667 search results - page 10 / 134 » Approximation algorithms for connected facility location pro... |
114
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
111
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
114
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
94
Voted
IPCO
2004
15 years 3 months ago
2004
118
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...