3875 search results - page 199 / 775 » Approximation algorithms for the 0-extension problem |
131
Voted
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
143
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
179
click to vote
CGO
2011
IEEE
14 years 9 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
190
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
133
click to vote
COCO
2005
Springer
15 years 10 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...