New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem

B. Behsaz,M. Salavatipour,Zoya Svitkina

Published 2012 in Algorithmica

ABSTRACT

No abstract is available for this paper.

PUBLICATION RECORD

Publication year
2012
Venue
Algorithmica
Publication date
2012-07-04
Fields of study
Mathematics, Computer Science
Identifiers
DOI 10.1007/s00453-015-0012-z
External record
Open on Semantic Scholar
Source metadata
Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

No claims are published for this paper.

CONCEPTS

No concepts are published for this paper.

REFERENCES

A 5-Approximation for Capacitated Facility Location
2012influential reference
Approximation algorithms for clustering problems
2012cited by this paper
A 1.488 approximation algorithm for the uncapacitated facility location problem
2011cited by this paper
A 3-Approximation for Facility Location with Uniform Capacities
2010cited by this paper
IEOR 269, Spring 2010 Integer Programming and Combinatorial Optimization
2010cited by this paper
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
2009influential reference
Anycast CDNS revisited
2008cited by this paper
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
2006cited by this paper
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
2005cited by this paper
LP-based approximation algorithms for capacitated facility location
2004cited by this paper
Approximation algorithms for facility location problems
2004influential reference
A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract)
2004cited by this paper
Approximation Algorithms for Clustering Problems
2004cited by this paper
A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem
2003cited by this paper
Universal Facility Location
2003cited by this paper
A tight bound on approximating arbitrary metrics by tree metrics
2003cited by this paper
Improved Approximation Algorithms for Metric Facility Location Problems
2002cited by this paper
A new greedy approach for facility location problems
2002cited by this paper
Local search heuristic for k-median and facility location problems
2001cited by this paper
Facility location : applications and theory
2001cited by this paper
Facility location with nonuniform hard capacities
2001cited by this paper
Analysis of a local search heuristic for facility location problems
2000cited by this paper
Approximation algorithms for facility location problems
2000influential reference
Primal-dual approximation algorithms for metric facility location and k-median problems
1999influential reference
Improved approximation algorithms for a capacitated facility location problem
1999cited by this paper
Improved combinatorial algorithms for the facility location and k-median problems
1999cited by this paper
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
1999cited by this paper
Improved approximation algorithms for capacitated facility location problems
1999cited by this paper
Improved Approximation Algorithms for Uncapacitated Facility Location
1998cited by this paper
Approximation schemes for Euclidean k-medians and related problems
1998cited by this paper
On approximating arbitrary metrices by tree metrics
1998cited by this paper
Greedy strikes back: improved facility location algorithms
1998cited by this paper
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
1997influential reference
Approximation algorithms for facility location problems (extended abstract)
1997cited by this paper
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
1996cited by this paper
An approximation algorithm for the generalized assignment problem
1993influential reference
e-approximations with minimum packing constraint violation (extended abstract)
1992cited by this paper
FACILITIES LOCATION: MODELS AND METHODS
1988cited by this paper
An efficient approximation scheme for the one-dimensional bin-packing problem
1982cited by this paper
The NP-Completeness Column: An Ongoing Guide
1982cited by this paper
Bin packing can be solved within 1 + ε in linear time
1981cited by this paper
Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979
1980cited by this paper

CITED BY

Airports and railways with unsplittable demand
2025cites this paper
A Survey of Approximation Algorithms for the Universal Facility Location Problem
2025influential citation
Extended array model of star capacity-aware delay-based next controller placement problem for multiple controller failures in software-defined wide area networks
2022cites this paper
Star capacity-aware latency-based next controller placement problem with considering single controller failure in software-defined wide-area networks
2022cites this paper
Cost-Effective Sensor Data Collection from Internet-of-Things Zones Using Existing Transportation Fleets
2019cites this paper
Resilient controller placement problems in software defined wide-area networks
2019cites this paper
Approximating Airports and Railways
2018cites this paper
On Facility Location with General Lower Bounds
2018cites this paper
Capacity-Aware and Delay-Guaranteed Resilient Controller Placement for Software-Defined WANs
2018cites this paper
Gestion des ressources et de la consommation énergétique dans les réseaux mobiles hétérogènes
2016cites this paper
Centralized Mobile Users Assignment Strategies for Energy Management in Het-LTE Networks
2016cites this paper
Approximation algorithms for resource allocation optimization.
2014cites this paper
Approximation Algorithms for Mobile Data Caching in Small Cell Networks
2014influential citation
LP-Based Algorithms for Capacitated Facility Location
2014cites this paper
Approximation caching and routing algorithms for massive mobile data delivery
2013cites this paper