Related papers: Finding D-optimal designs by randomised decomposit…
Submodular maximization is one of the central topics in combinatorial optimization. It has found numerous applications in the real world. In the past decades, a series of algorithms have been proposed for this problem. However, most of the…
We give upper and lower bounds on the determinant of a perturbation of the identity matrix or, more generally, a perturbation of a nonsingular diagonal matrix. The matrices considered are, in general, diagonally dominant. The lower bounds…
A dominating set D in a graph G is a subset of its vertices such that every vertex of the graph which does not belong to set D is adjacent to at least one vertex from set D. A set of vertices of graph G is a global dominating set if it is a…
We construct a number of new (v;r,s;lambda) supplementary difference sets (SDS) with v odd and lambda = (r+s)-(v-1)/2. In particular, these give rise to D-optimal matrices of the four new orders 206, 242, 262, 482 constructed here for the…
Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…
Submodular maximization constitutes a prominent research topic in combinatorial optimization and theoretical computer science, with extensive applications across diverse domains. While substantial advancements have been achieved in…
We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular functions and monotone subadditive functions. Even though…
The problem of combinatorially determining the rank of the 3-dimensional bar-joint {\em rigidity matroid} of a graph is an important open problem in combinatorial rigidity theory. Maxwell's condition states that the edges of a graph $G=(V,…
Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion planning and VLSI circuit design. A $d$-dimensional zero-one…
In an instance of the minimum eigenvalue problem, we are given a collection of $n$ vectors $v_1,\ldots, v_n \subset {\mathbb{R}^d}$, and the goal is to pick a subset $B\subseteq [n]$ of given vectors to maximize the minimum eigenvalue of…
We initiate the study of approximating the largest induced expander in a given graph $G$. Given a $\Delta$-regular graph $G$ with $n$ vertices, the goal is to find the set with the largest induced expansion of size at least $\delta \cdot…
The control and sensing of large-scale systems results in combinatorial problems not only for sensor and actuator placement but also for scheduling or observability/controllability. Such combinatorial constraints in system design and…
Given a set of $n$ vectors in $\mathbb{R}^d$, the goal of the \emph{determinant maximization} problem is to pick $k$ vectors with the maximum volume. Determinant maximization is the MAP-inference task for determinantal point processes (DPP)…
Three algorithms looking for pretty large partial Hadamard matrices are described. Here "large" means that hopefully about a third of a Hadamard matrix (which is the best asymptotic result known so far, [dLa00]) is achieved. The first one…
We present MADAM, a parallel semidefinite based exact solver for Max-Cut, a problem of finding the cut with maximum weight in a given graph. The algorithm uses branch and bound paradigm that applies alternating direction method of…
We present a deterministic distributed algorithm that computes a $(2\Delta-1)$-edge-coloring, or even list-edge-coloring, in any $n$-node graph with maximum degree $\Delta$, in $O(\log^7 \Delta \log n)$ rounds. This answers one of the…
This paper considers the problem of constructing optimal discriminating experimental designs for competing regression models on the basis of the T-optimality criterion introduced by Atkinson and Fedorov [Biometrika 62 (1975) 57-70].…
The dominating set problem (DSP) is one of the most famous problems in combinatorial optimization. It is defined as follows. For a given simple graph $G=(V,E)$, a dominating set of $G$ is a subset $S\subseteq V$ such that every vertex in $…
We consider the problem of efficiently solving a system of $n$ non-linear equations in ${\mathbb R}^d$. Addressing Smale's 17th problem stated in 1998, we consider a setting whereby the $n$ equations are random homogeneous polynomials of…
We study the convex relaxation of a polynomial optimization problem, maximizing a product of linear forms over the complex sphere. We show that this convex program is also a relaxation of the permanent of Hermitian positive semidefinite…