667 search results - page 8 / 134 » Approximation algorithms for connected facility location pro... |
125
click to vote
SIGECOM
2003
ACM
15 years 7 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...
115
Voted
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
99
Voted
COCOA
2009
Springer
15 years 9 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...
131
click to vote
ENDM
2010
15 years 2 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
144
Voted
SAINT
2008
IEEE
15 years 9 months ago
2008
IEEE
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...