A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Incremental algorithms for facility location and k-Median
Theoretical Computer Science - Approximation and online algorithms
Performance Guarantees of Local Search for Multiprocessor Scheduling
INFORMS Journal on Computing
Model-driven optimization using adaptive probes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A constant factor approximation algorithm for k-median clustering with outliers
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for clustering uncertain data
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximation algorithms for co-clustering
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fault-tolerant facility location
ACM Transactions on Algorithms (TALG)
An approximation ratio for biclustering
Information Processing Letters
A Local-Search 2-Approximation for 2-Correlation-Clustering
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Maximum Gradient Embeddings and Monotone Clustering
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
Approximate clustering without the approximation
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Ranking tournaments: Local search and a new algorithm
Journal of Experimental Algorithmics (JEA)
Exceeding expectations and clustering uncertain data
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Algorithms (TALG)
Facility location with hierarchical facility costs
ACM Transactions on Algorithms (TALG)
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
Mathematics of Operations Research
Capacitated domination problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Better bounds for incremental medians
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
Lower-bounded facility location
ACM Transactions on Algorithms (TALG)
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Differentially private combinatorial optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for k-modes clustering
ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
Approximation algorithms for the bottleneck asymmetric traveling salesman problem
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Clustering with or without the approximation
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Budgeted red-blue median and its generalizations
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Theoretical Computer Science
Better bounds for incremental medians
Theoretical Computer Science
Approximation Algorithms for Multicommodity Facility Location Problems
SIAM Journal on Discrete Mathematics
Online and incremental algorithms for facility location
ACM SIGACT News
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for the Fault-Tolerant Facility Placement problem
Information Processing Letters
Minimizing movement in mobile facility location problems
ACM Transactions on Algorithms (TALG)
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Property testing
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Property testing
An experimental evaluation of incremental and hierarchical k-median algorithms
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Fast clustering using MapReduce
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Network-aware service placement and selection algorithms on large-scale overlay networks
Computer Communications
Locating depots for capacitated vehicle routing
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Min-sum clustering of protein sequences with limited distance information
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
ACM Transactions on Algorithms (TALG)
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Data reduction for weighted and outlier-resistant clustering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Price of anarchy, locality gap, and a network service provider game
WINE'05 Proceedings of the First international conference on Internet and Network Economics
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
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A 3-approximation for facility location with uniform capacities
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The controller placement problem
Proceedings of the first workshop on Hot topics in software defined networks
Clustering under perturbation resilience
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Selfish overlay network creation and maintenance
IEEE/ACM Transactions on Networking (TON)
The controller placement problem
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
The effectiveness of lloyd-type methods for the k-means problem
Journal of the ACM (JACM)
Data stability in clustering: a closer look
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Optimizing client assignment for enhancing interactivity in distributed interactive applications
IEEE/ACM Transactions on Networking (TON)
Greedy selfish network creation
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
Clustering under approximation stability
Journal of the ACM (JACM)
Pushing CDN-ISP collaboration to the limit
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
We analyze local search heuristics for the metric k-median and facility location problems. We define the locality gap of a local search procedure for a minimization problem 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 5. Furthermore, if we permit up to p facilities to be swapped simultaneously, then the locality gap is 3+2/p. This is the first analysis of a 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 3. This improves the bound of 5 given by M. Korupolu, C. Plaxton, and R. Rajaraman [Analysis of a Local Search Heuristic for Facility Location Problems, Technical Report 98-30, DIMACS, 1998]. We also consider a capacitated facility location problem where each facility has a capacity and we are allowed to open multiple copies of a facility. For this problem we introduce a new local search operation which opens one or more copies of a facility and drops zero or more facilities. We prove that this local search has a locality gap between 3 and 4.