206 search results - page 6 / 42 » Constant factor approximation algorithm for the knapsack med... |
109
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
138
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
135
click to vote
SODA
2010
ACM
16 years 12 days ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
138
click to vote
TALG
2010
15 years 1 months ago
2010
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...
113
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....