344 search results - page 5 / 69 » A constant factor approximation algorithm for a class of cla... |
103
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...
135
click to vote
FOCS
2007
IEEE
15 years 8 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...
143
click to vote
WAOA
2010
Springer
15 years 9 days ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
134
click to vote
TALG
2010
15 years 25 days 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...
106
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...