Approximation algorithms for geometric median problems
Information Processing Letters
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
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
Approximation algorithms for clustering problems
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Improved approximation algorithms for a capacitated facility location problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Cooperative facility location games
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
K-medians, facility location, and the Chernoff-Wald bound
SODA '00 Proceedings of the eleventh 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
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
IEEE Transactions on Parallel and Distributed Systems
Clustering to minimize the sum of cluster diameters
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
ACM SIGACT News
Gravity based spatial clustering
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Embeddings and non-approximability of geometric problems
SODA '03 Proceedings of the fourteenth 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
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for facility location problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
On the Power of Priority Algorithms for Facility Location and Set Cover
APPROX '02 Proceedings of the 5th 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
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
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
Approximation schemes for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
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
Multicommodity facility location
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Cooperative facility location games
Journal of Algorithms - Special issue: SODA 2000
Clustering to minimize the sum of cluster diameters
Journal of Computer and System Sciences - STOC 2001
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A simple and deterministic competitive algorithm for online facility location
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
Information Processing Letters
Distributed self-stabilizing placement of replicated resources in emerging networks
IEEE/ACM Transactions on Networking (TON)
A primal-dual algorithm for online non-uniform facility location
Journal of Discrete Algorithms
The problem of placing mobility anchor points in wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobility management and wireless access
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
A simple and deterministic competitive algorithm for online facility location
Information 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
On the competitive ratio for online facility location
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Online load balancing made simple: greedy strikes back
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximation algorithms for bounded facility location
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Rapid randomized pruning for fast greedy distributed algorithms
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
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 Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
SIAM Journal on Computing
Minimizing movement in mobile facility location problems
ACM Transactions on Algorithms (TALG)
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
A local facility location algorithm for sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Bucket game with applications to set multicover and dynamic page migration
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Multicommodity facility location under group Steiner access cost
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Order-preserving transformations and greedy-like algorithms
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
The approximation gap for the metric facility location problem is not yet closed
Operations Research Letters
Privacy rights management in multiparty multilevel DRM system
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Super-fast distributed algorithms for metric facility location
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
New approximation algorithms for the unsplittable capacitated facility location problem
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Approximating k-median via pseudo-approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A cross-monotonic cost-sharing scheme for the concave facility location game
Journal of Global Optimization
| Hi-index | 0.00 |