3 search results - page 1 / 1 » A combinatorial maximum cover approach to 2D translational g... |
CCCG
2003
13 years 6 months ago
2003
TASE
2010
IEEE
12 years 12 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...