We study the Sherali-Adams lift-and-project hierarchy of linear programming relaxations of the matching polytope. Our main result is an asymptotically tight expression 1 + 1/k for...
Although support vector machines (SVMs) for binary classification give rise to a decision rule that only relies on a subset of the training data points (support vectors), it will ...
Antoni B. Chan, Nuno Vasconcelos, Gert R. G. Lanck...
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...