72 search results - page 4 / 15 » Approximating Semidefinite Packing Programs |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
DAM
2008
13 years 9 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
DC
2011
12 years 9 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
COR
2006
13 years 9 months ago
2006
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov