7006 search results - page 9 / 1402 » Approximation Algorithms |
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
111
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
IPL
2006
14 years 11 months ago
2006
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
ORL
1998
14 years 11 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...