Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fault-tolerant facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for hierarchical location problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Multicommodity facility location
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the two-level facility location problem via a quasi-greedy approach
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Facility location with Service Installation Costs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A simple and deterministic competitive algorithm for online facility location
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
WWW '05 Proceedings of the 14th international conference on World Wide Web
Approximating k-median with non-uniform capacities
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Facility location with hierarchical facility costs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation algorithms for hierarchical location problems
Journal of Computer and System Sciences - Special issue on network algorithms 2005
A distributed O(1)-approximation algorithm for the uniform facility location problem
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Asymmetry in k-center variants
Theoretical Computer Science - Approximation and online algorithms
Incremental algorithms for facility location and k-Median
Theoretical Computer Science - Approximation and online algorithms
Theoretical Computer Science - Algorithmic applications in management
A primal-dual algorithm for online non-uniform facility location
Journal of Discrete Algorithms
A Transportation Problem with Minimum Quantity Commitment
Transportation Science
On the bounded-hop MST problem on random Euclidean instances
Theoretical Computer Science
Lower-bounded facility location
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating connected facility location problems via random facility sampling and core detouring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating k-hop minimum spanning trees in Euclidean metrics
Information Processing Letters
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Journal of Discrete Algorithms
ACM Transactions on Algorithms (TALG)
The Fault-Tolerant Facility Allocation Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A simple and deterministic competitive algorithm for online facility location
Information and Computation
Improved combinatorial approximation algorithms for the k-level facility location problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the competitive ratio for online facility location
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Distributed facility location algorithms for flexible configuration of wireless sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Importance sampling via load-balanced facility location
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Parallel approximation algorithms for facility-location problems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Scalable service migration in autonomic network environments
IEEE Journal on Selected Areas in Communications
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
Solving bus terminal location problems using evolutionary algorithms
Applied Soft Computing
Incremental Facility Location Problem and Its Competitive Algorithms
Journal of Combinatorial Optimization
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
SIAM Journal on Computing
Online and incremental algorithms for facility location
ACM SIGACT News
Optimal network locality in distributed virtualized data-centers
Computer Communications
Unconstrained and constrained fault-tolerant resource allocation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Approximation algorithms for 2-stage stochastic optimization problems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Inapproximability of the multi-level uncapacitated facility location problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A primal-dual algorithm for online non-uniform facility location
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Facility location in sublinear time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Bucket game with applications to set multicover and dynamic page migration
ESA'05 Proceedings of the 13th annual European conference on Algorithms
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
A new approximation algorithm for the k-facility location problem
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Inventory and facility location models with market selection
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Multicommodity facility location under group Steiner access cost
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Facility location in a global view
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
An approximation algorithm for a facility location problem with inventories and stochastic demands
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Order-preserving transformations and greedy-like algorithms
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Approximation algorithms for the k-median problem
Efficient Approximation and Online Algorithms
Non-cooperative facility location and covering games
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
The approximation gap for the metric facility location problem is not yet closed
Operations Research Letters
The k-level facility location game
Operations Research Letters
An approximation algorithm for a facility location problem with stochastic demands and inventories
Operations Research Letters
A note on the maximization version of the multi-level facility location problem
Operations Research Letters
Approximating k-hop minimum-spanning trees
Operations Research Letters
QoS-aware placement of stream processing service
The Journal of Supercomputing
A Local Heuristic for Latency-Optimized Distributed Cloud Deployment
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.01 |
In this paper we present a 1.52-approximation algorithm for the uncapacitated metric facility location problem. This algorithm uses an idea of cost scaling, a greedy algorithm of Jain, Mahdian and Saberi, and a greedy augmentation procedure of Charikar, Guha and Khuller. We also present a 2.89-approximation for the capacitated metric facility location problem with soft capacities.