72 search results - page 8 / 15 » Approximating Semidefinite Packing Programs |
SODA
2001
ACM
13 years 11 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
FCT
2007
Springer
14 years 3 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
TSMC
2002
13 years 9 months ago
2002
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
TCS
2008
13 years 9 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...