Sciweavers

79 search results - page 8 / 16
» LP-based Approximation Algorithms for Capacitated Facility L...
Sort
View
JCO
1998
102views more  JCO 1998»
14 years 9 months ago
Facility Location with Dynamic Distance Functions
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram...
COCOA
2009
Springer
15 years 4 months ago
Improved Bounds for Facility Location Games with Fair Cost Allocation
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...
Thomas Dueholm Hansen, Orestis Telelis
ANOR
2007
165views more  ANOR 2007»
14 years 9 months ago
Financial scenario generation for stochastic multi-stage decision processes as facility location problems
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...
Ronald Hochreiter, Georg Ch. Pflug
ICCV
2009
IEEE
16 years 2 months ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
15 years 7 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu