79 search results - page 10 / 16 » LP-based Approximation Algorithms for Capacitated Facility L... |
139
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
152
click to vote
SODA
2010
ACM
15 years 1 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
131
Voted
SODA
2010
ACM
16 years 21 days ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
149
click to vote
SIGECOM
2009
ACM
15 years 9 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
135
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...