Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for a capacitated facility location problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete 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
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Analysis of a Local Search Heuristic for Facility Location Problems
Analysis of a Local Search Heuristic for Facility Location Problems
ACM SIGACT News
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A local search approximation algorithm for k-means clustering
Proceedings of the eighteenth annual symposium on Computational geometry
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
Fault-tolerant facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Price of Truth: Frugality in Truthful Mechanisms
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Improved Approximation Algorithms for Multilevel Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Maintaining variance and k-medians over data stream windows
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Clustering Data Streams: Theory and Practice
IEEE Transactions on Knowledge and Data Engineering
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
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
Joint object placement and node dimensioning for internet content distribution
Information Processing Letters
On coresets for k-means and k-median clustering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Algorithms for dynamic geometric problems over data streams
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A k-Median Algorithm with Running Time Independent of Data Size
Machine Learning
A New Conceptual Clustering Framework
Machine Learning
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Clustering moving objects for spatio-temporal selectivity estimation
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
A local search approximation algorithm for k-means clustering
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometrySoCG2002
Approximating k-median with non-uniform capacities
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
Information Processing Letters
ACM Transactions on Algorithms (TALG)
Performance guarantees for hierarchical clustering
Journal of Computer and System Sciences - Special issue on COLT 2002
Facility location with hierarchical facility costs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On k-Median clustering in high dimensions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The reverse greedy algorithm for the metric k-median problem
Information Processing Letters
Building triangulations using ε-nets
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Locating repair shops in a stochastic environment
Computers and Operations Research
Approximations for minimum and min-max vehicle routing problems
Journal of Algorithms
Approximation algorithms for hierarchical location problems
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Replicated Server Placement with QoS Constraints
IEEE Transactions on Parallel and Distributed Systems
Asymmetry in k-center variants
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
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Best of both: a hybridized centroid-medoid clustering heuristic
Proceedings of the 24th international conference on Machine learning
Lower-bounded facility location
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A plant location guide for the unsure
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Towards event source unobservability with minimum network traffic in sensor networks
WiSec '08 Proceedings of the first ACM conference on Wireless network security
Sensor Selection for Minimizing Worst-Case Prediction Error
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Tight results for clustering and summarizing data streams
Proceedings of the 12th International Conference on Database Theory
EGOIST: overlay routing using selfish neighbor selection
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Locating repair shops in a stochastic environment
Computers and Operations Research
Optimizing segment caching for peer-to-peer on-demand streaming
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
Information Processing Letters
The reverse greedy algorithm for the metric k-median problem
Information Processing Letters
Approximations for minimum and min-max vehicle routing problems
Journal of Algorithms
A new approximation algorithm for the multilevel facility location problem
Discrete Applied Mathematics
Pairwise data clustering and applications
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Approximation to the minimum rooted star cover problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Better bounds for incremental medians
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Scalable service migration in autonomic network environments
IEEE Journal on Selected Areas in Communications
Efficient social-aware content placement in opportunistic networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Incremental Facility Location Problem and Its Competitive Algorithms
Journal of Combinatorial Optimization
Modeling and estimating the spatial distribution of healthcare workers
Proceedings of the 1st ACM International Health Informatics Symposium
Estimating the average of a Lipschitz-continuous function from one sample
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Better bounds for incremental medians
Theoretical Computer Science
Optimally designing caches to reduce P2P traffic
Computer Communications
An efficient local search algorithm for k-median problem
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
Parallel video streaming optimizing network throughput
Computer Communications
An improved competitive algorithm for one-dimensional incremental median problem
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Storage planning and replica assignment in content-centric publish/subscribe networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Center-based clustering under perturbation stability
Information Processing Letters
Constant factor approximation algorithm for the knapsack median 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
A local facility location algorithm for sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
A new template for solving p-median problems for trees in sub-quadratic time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
An improved approximation algorithm for uncapacitated facility location problem with penalties
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The reverse greedy algorithm for the metric K-median problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Streaming k-means on well-clusterable data
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Generalized machine activation problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Multicommodity facility location under group Steiner access cost
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Approximation algorithms for the k-median problem
Efficient Approximation and Online Algorithms
Oblivious medians via online bidding
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
An approximation algorithm for a facility location problem with stochastic demands and inventories
Operations Research Letters
Improved approximation algorithms for multilevel facility location problems
Operations Research Letters
A dependent LP-rounding approach for the k-median problem
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Approximating k-median via pseudo-approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
QoS-aware placement of stream processing service
The Journal of Supercomputing
Hi-index | 0.00 |
In this paper, we analyze local search heuristics for the k-median and facility location problems. We define the {\em locality gap\/} of a local search procedure as the maximum ratio of a locally optimum solution (obtained using this procedure) to the global optimum. For k-median, we show that local search with swaps has a locality gap of exactly 5. When we permit p facilities to be swapped simultaneously then the locality gap of the local search procedure is exactly 3+2/p. This is the first analysis of local search for k-median that provides a bounded performance guarantee with only k medians. This also improves the previous known 4 approximation for this problem. For Uncapacitated facility location, we show that local search, which permits adding, dropping and swapping a facility, has a locality gap of exactly 3. This improves the 5 bound of Korupolu et al. We also consider a capacitated facility location problem where each facilitym has a capacity and we are allowed to open multiple copies of a facility. For this problem we introduce a new operation which opens one or more copies of a facility and drops zero or more facilities. We prove that local search which permits this new operation has a locality gap between 3 and 4. instances where it is not necessary to satisfy every demand. Our algorithms provide the optimum total profit, while stretching the definition of locality by a constant and violating the required demands by a constant. We prove that without this stretch, the problem becomes NP-Hard to approximate. facility location, we show that local search, which permits adding, dropping and swapping a facility, has a locality gap of exactly 3. This improves the 5 bound of Korupolu et al. We also consider a capacitated facility location problem where each facilitym has a capacity and we are allowed to open multiple copies of a facility. For this problem we introduce a new operation which opens one or more copies of a facility and drops zero or more facilities. We prove that local search which permits this new operation has a locality gap between 3 and 4.