Sciweavers

76 search results - page 4 / 16
» Facility location with hierarchical facility costs
Sort
View
COCOA
2008
Springer
13 years 9 months ago
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong C...
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
13 years 9 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
JCO
2008
117views more  JCO 2008»
13 years 7 months ago
Approximation algorithms for connected facility location problems
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 7 months ago
On Pure and (approximate) Strong Equilibria of Facility Location Games
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...
Thomas Dueholm Hansen, Orestis Telelis
HM
2007
Springer
137views Optimization» more  HM 2007»
14 years 1 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic