284 search results - page 38 / 57 » On Some Polyhedra Covering Problems |
ECIR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. This paper presents first steps towards building a music information system like last.fm, but with the major difference that the data is automatically retrieved from the ...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
STOC
2009
ACM
14 years 9 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...