Sciweavers

79 search results - page 9 / 16
» LP-based Approximation Algorithms for Capacitated Facility L...
Sort
View
99
Voted
TCS
2010
14 years 10 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer
APPROX
2004
Springer
120views Algorithms» more  APPROX 2004»
15 years 5 months ago
Simultaneous Source Location
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
Konstantin Andreev, Charles Garrod, Bruce M. Maggs...
90
Voted
INFORMS
2008
241views more  INFORMS 2008»
14 years 11 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
EOR
2006
76views more  EOR 2006»
14 years 11 months ago
Load balancing and capacity constraints in a hierarchical location model
Recent work on the location of perinatal facilities in the municipality of Rio de Janeiro resulted in the development of an uncapacitated, three-level hierarchical model. An impor...
Roberto D. Galvão, Luis Gonzalo Acosta Espe...
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
13 years 2 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy