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
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
Quick and good facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Fault-tolerant facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
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)
Approximating the two-level facility location problem via a quasi-greedy approach
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum spanning tree with hop restrictions
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
WWW '05 Proceedings of the 14th international conference on World Wide Web
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation algorithms for hierarchical location problems
Journal of Computer and System Sciences - Special issue on network algorithms 2005
A distributed O(1)-approximation algorithm for the uniform facility location problem
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
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
Theoretical Computer Science - Algorithmic applications in management
Proceedings of the 8th ACM conference on Electronic commerce
Approximation algorithms for stochastic and risk-averse optimization
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the bounded-hop MST problem on random Euclidean instances
Theoretical Computer Science
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
A continuous facility location problem and its application to a clustering problem
Proceedings of the 2008 ACM symposium on Applied computing
Approximating k-hop minimum spanning trees in Euclidean metrics
Information Processing Letters
Fault-tolerant facility location
ACM Transactions on Algorithms (TALG)
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximate clustering without the approximation
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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)
Heuristics for the transportation problem in planning of ICT access networks
WOC '08 Proceedings of the Eighth IASTED International Conference on Wireless and Optical Communications
A new approximation algorithm for the multilevel facility location problem
Discrete Applied Mathematics
Non-cooperative facility location and covering games
Theoretical Computer Science
Improved combinatorial approximation algorithms for the k-level facility location problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
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
Randomized priority algorithms
Theoretical Computer Science
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Importance sampling via load-balanced facility location
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
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
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
Solving bus terminal location problems using evolutionary algorithms
Applied Soft Computing
FPGA implementation of a Greedy algorithm for set covering
RTC'05 Proceedings of the 14th IEEE-NPSS conference on Real time
Incremental Facility Location Problem and Its Competitive Algorithms
Journal of Combinatorial Optimization
An approximation algorithm for the k-level capacitated facility location problem
Journal of Combinatorial Optimization
A primal-dual approximation algorithm for the k-level stochastic facility location problem
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Theoretical Computer Science
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
SIAM Journal on Computing
Approximation Algorithms for Multicommodity Facility Location Problems
SIAM Journal on Discrete Mathematics
Online and incremental algorithms for facility location
ACM SIGACT News
Computers and Industrial Engineering
Approximation algorithms for the Fault-Tolerant Facility Placement problem
Information Processing Letters
Approximation algorithms for single and multi-commodity connected facility location
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
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
A 1.488 approximation algorithm for the uncapacitated facility location problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Optimal network locality in distributed virtualized data-centers
Computer Communications
Unconstrained and constrained fault-tolerant resource allocation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Center-based clustering under perturbation stability
Information Processing Letters
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
SIAM Journal on Computing
A distributed protocol for the bounded-hops converge-cast in ad-hoc networks
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Inapproximability of the multi-level uncapacitated facility location problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Non-metric multicommodity and multilevel facility location
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Facility location in sublinear time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An improved approximation algorithm for uncapacitated facility location problem with penalties
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
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
Generalized machine activation problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Facility location in a global view
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
An approximation algorithm for a facility location problem with inventories and stochastic demands
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Improved approximation algorithms for the robust fault-tolerant facility location problem
Information Processing Letters
Non-cooperative facility location and covering games
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Fault-tolerant facility location: a randomized dependent LP-Rounding algorithm
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
An approximation algorithm for the k-level stochastic facility location problem
Operations Research Letters
An approximation algorithm for a facility location problem with stochastic demands and inventories
Operations Research Letters
Approximation algorithm for facility location with service installation costs
Operations Research Letters
Improved approximation algorithms for multilevel facility location problems
Operations Research Letters
Approximating k-hop minimum-spanning trees
Operations Research Letters
Data stability in clustering: a closer look
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
A 1.488 approximation algorithm for the uncapacitated facility location problem
Information and Computation
Theoretical Computer Science
Clustering under approximation stability
Journal of the ACM (JACM)
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.01 |