352 search results - page 19 / 71 » Experimental Analysis of Approximation Algorithms for the Ve... |
163
click to vote
JAL
2006
15 years 5 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
161
click to vote
FSTTCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
177
click to vote
FOCS
2008
IEEE
16 years 6 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
159
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
148
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...