7006 search results - page 149 / 1402 » Approximation Algorithms |
121
Voted
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...
113
Voted
DISOPT
2006
15 years 2 months ago
2006
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
116
Voted
AAIM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
156
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
126
Voted
SWAT
1994
Springer
15 years 6 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...