344 search results - page 16 / 69 » A constant factor approximation algorithm for a class of cla... |
118
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
129
Voted
SIAMMAX
2010
14 years 9 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
107
Voted
WAOA
2007
Springer
15 years 8 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
107
Voted
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
99
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...