Integer and combinatorial optimization
Integer and combinatorial optimization
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for geometric median problems
Information Processing Letters
How to allocate network centers
Journal of Algorithms
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth 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
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A primal-dual schema based approximation algorithm for the element connectivity problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the bidirected cut relaxation for the metric Steiner tree problem
Proceedings of the tenth 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 Approximation Algorithms for Capacitated Facility Location Problems
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
The Capacitated K-Center Problem (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Clustering for edge-cost minimization (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Engineering the compression of massive tables: an experimental approach
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Mobile facility location (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Web caching using access statistics
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Sublinear time approximate clustering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for fault tolerant facility location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Separating repeats in DNA sequence assembly
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Clustering to minimize the sum of cluster diameters
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximating min-sum k-clustering in metric spaces
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Profit-earning facility location
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms for constrained for constrained node weighted steiner tree problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM SIGACT News
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM (JACM)
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Capacitated vertex covering with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient integration of multi-hop wireless and wired networks with QoS constraints
Proceedings of the 8th annual international conference on Mobile computing and networking
The general Steiner tree-star problem
Information Processing Letters
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Proceedings of the 8th 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
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Dynamic Replica Placement for Scalable Content Delivery
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Approximation algorithms for facility location problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and 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
Designing overlay multicast networks for streaming
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing - Special issue: Selected papers from PODC '01
Approximation schemes for clustering 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)
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
On coresets for k-means and k-median clustering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Clustering Large Graphs via the Singular Value Decomposition
Machine Learning
A k-Median Algorithm with Running Time Independent of Data Size
Machine Learning
A New Conceptual Clustering Framework
Machine Learning
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Clustering moving objects for spatio-temporal selectivity estimation
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Efficient integration of multihop wireless and wired networks with QoS constraints
IEEE/ACM Transactions on Networking (TON)
Clustering via matrix powering
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
Information Processing Letters
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On Optimizing Distance-Based Similarity Search for Biological Databases
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Approximating the k-multicut problem
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
Achieving anonymity via clustering
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Competitive algorithms for maintaining a mobile center
Mobile Networks and Applications
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
Correlation clustering in general weighted graphs
Theoretical Computer Science - Approximation and online algorithms
Comparison and analysis of ten static heuristics-based Internet data replication techniques
Journal of Parallel and Distributed Computing
Sensor Selection for Minimizing Worst-Case Prediction Error
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
The Fault-Tolerant Facility Allocation Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
Information Processing Letters
Improving customer proximity to railway stations
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
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
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Self-organizing monitoring agents for hierarchical event correlation
DSOM'07 Proceedings of the Distributed systems: operations and management 18th IFIP/IEEE international conference on Managing virtualization of networks and services
PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
Achieving anonymity via clustering
ACM Transactions on Algorithms (TALG)
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Scalable service migration in autonomic network environments
IEEE Journal on Selected Areas in Communications
An algorithm for the facility location problems
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 1
Accelerating the local search algorithm for the facility location
MACMESE'10 Proceedings of the 12th WSEAS international conference on Mathematical and computational methods in science and engineering
An efficient local search algorithm for k-median problem
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
Optimal network locality in distributed virtualized data-centers
Computer Communications
A local facility location algorithm for sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Price of anarchy, locality gap, and a network service provider game
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Facility location in a global view
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Computer Science Review
Selfish overlay network creation and maintenance
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We present approximation algorithms for the metric uncapacitated facility location problem and the metric k-median problem achieving guarantees of 3 and 6 respectively. The distinguishing feature of our algorithms is their low running time: O(m log m) and O(m log m (L + log(n))) respectively, where n and m are the total number of vertices and edges in the underlying graph. The main algorithmic idea is a new extension of the primal-dual schema.