667 search results - page 17 / 134 » Approximation algorithms for connected facility location pro... |
116
Voted
CCCG
2003
14 years 11 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
83
Voted
SIGECOM
2006
ACM
15 years 4 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
141
Voted
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
104
click to vote
SODA
2010
ACM
14 years 8 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...
88
Voted
MP
1998
14 years 10 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...