14 search results - page 1 / 3 » Constant Factor Lasserre Integrality Gaps for Graph Partitio... |
CORR
2012
Springer
12 years 20 days ago
2012
Springer
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...