207 search results - page 3 / 42 » Improved Approximation Algorithm for Connected Facility Loca... |
80
Voted
ALGORITHMICA
2004
14 years 11 months ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
87
Voted
WINE
2010
Springer
14 years 9 months ago
2010
Springer
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
74
Voted
COCOA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
102
click to vote
IPCO
2010
14 years 10 months ago
2010
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
95
Voted
TALG
2010
14 years 10 months ago
2010
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...