Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An 0.828–approximation algorithm for the uncapacitated facility location problem
Discrete Applied Mathematics
A 3-approximation algorithm for the k-level uncapacitated facility location problem
Information Processing Letters
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts
SIAM Journal on Discrete Mathematics
Polynomially Solvable Cases of the Simple Plant Location Problem
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Fault-tolerant facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Facility location with Service Installation Costs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
Facility location with hierarchical facility costs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Incremental algorithms for facility location and k-Median
Theoretical Computer Science - Approximation and online algorithms
A primal-dual algorithm for online non-uniform facility location
Journal of Discrete Algorithms
Approximation algorithms for stochastic and risk-averse optimization
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Lower-bounded facility location
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fault-tolerant facility location
ACM Transactions on Algorithms (TALG)
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
The Fault-Tolerant Facility Allocation Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Facility location with hierarchical facility costs
ACM Transactions on Algorithms (TALG)
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
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
Lower-bounded facility location
ACM Transactions on Algorithms (TALG)
Incremental Facility Location Problem and Its Competitive Algorithms
Journal of Combinatorial Optimization
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
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
Approximation algorithms for the Fault-Tolerant Facility Placement problem
Information Processing Letters
Minimizing movement in mobile facility location problems
ACM Transactions on Algorithms (TALG)
Approximation algorithm for the uniform bounded facility problem
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Network-aware service placement and selection algorithms on large-scale overlay networks
Computer Communications
On the $p$-Median Polytope and the Intersection Property: Polyhedra and Algorithms
SIAM Journal on Discrete Mathematics
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
Facility location in a global view
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Improved approximation algorithms for the robust fault-tolerant facility location problem
Information Processing Letters
Approximation algorithm for facility location with service installation costs
Operations Research Letters
Improved approximation algorithms for multilevel facility location problems
Operations Research Letters
Improved LP-rounding approximation algorithm for k-level uncapacitated facility location
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Approximation algorithm for uniform bounded facility location problem
Journal of Combinatorial Optimization
Approximating the reliable resource allocation problem using inverse dual fitting
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Improved approximation algorithms for constrained fault-tolerant resource allocation
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We design a new approximation algorithm for the metric uncapacitated facility location problem. This algorithm is of LP rounding type and is based on a rounding technique developed in [5,6,7].