Primal-Dual Algorithms for Connected Facility Location Problems

14 years 5 months ago

Download www.math.uwaterloo.ca

We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility i has a facility opening

Chaitanya Swamy, Amit Kumar

Real-time Traffic

ALGORITHMICA 2004 | Connected Facility Location |

claim paper

» Approximate kMSTs and kSteiner Trees via the PrimalDual Method and Lagrangean Relaxation

» A General Framework for a Class of First Order PrimalDual Algorithms for Convex Optimizati...

» Approximating connected facility location problems via random facility sampling and core d...

» Connected facility location via random facility sampling and core detouring

» Approximation algorithms for connected facility location problems

» Improved Approximation Algorithm for Connected Facility Location Problems

» An approximation algorithm for the fault tolerant metric facility location problem

» Constant factor approximation algorithm for the knapsack median problem

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2004
Where	ALGORITHMICA
Authors	Chaitanya Swamy, Amit Kumar

Comments (0)

Sciweavers

Primal-Dual Algorithms for Connected Facility Location Problems

ALGORITHMICA 2004 | Connected Facility Location |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers