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
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
The primal-dual method for approximation algorithms and its application to network design 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
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
Clustering in large graphs and matrices
Proceedings of the tenth 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
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Primal-Dual Schema Based Approximation Algorithms (Abstract)
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Equitable cost allocations via primal-dual-type algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
High-density model for server allocation and placement
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fault-tolerant facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Primal-dual schema based approximation algorithms
Theoretical aspects of computer science
An approximation algorithm for the fault tolerant metric facility location problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Primal-Dual Algorithms for Connected Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Primal-Dual Schema Based Approximation Algorithms
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case
Proceedings of the 2004 ACM symposium on Applied computing
Facility location with Service Installation Costs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Clustering to minimize the sum of cluster diameters
Journal of Computer and System Sciences - STOC 2001
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
Primal-dual algorithms for deterministic inventory problems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Machine Learning
A simple and deterministic competitive algorithm for online facility location
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
WWW '05 Proceedings of the 14th international conference on World Wide Web
A constant approximation algorithm for the one-warehouse multi-retailer problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Limitations of cross-monotonic cost sharing schemes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Network design for information networks
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
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Facility location with hierarchical facility costs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A general approach for incremental approximation and hierarchical clustering
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
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
Replicated Server Placement with QoS Constraints
IEEE Transactions on Parallel and Distributed Systems
Real time scheduling with a budget: parametric-search is better than binary search
Information Processing Letters
Incremental algorithms for facility location and k-Median
Theoretical Computer Science - Approximation and online algorithms
Algorithmic aspects of bandwidth trading
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science - Algorithmic applications in management
New primal-dual algorithms for Steiner tree problems
Computers and Operations Research
A primal-dual algorithm for online non-uniform facility location
Journal of Discrete Algorithms
Theoretical Computer Science
Cut problems in graphs with a budget constraint
Journal of Discrete Algorithms
Primal-Dual Algorithms for Deterministic Inventory Problems
Mathematics of Operations Research
Cache placement in sensor networks under an update cost constraint
Journal of Discrete Algorithms
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Eisenberg-Gale markets: algorithms and structural properties
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the 8th ACM conference on Electronic commerce
Improving voltage assignment by outlier detection and incremental placement
Proceedings of the 44th annual Design Automation Conference
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
Online make-to-order joint replenishment model: primal dual competitive algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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
Approximating connected facility location problems via random facility sampling and core detouring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Limitations of cross-monotonic cost-sharing schemes
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
A discriminative framework for clustering via similarity functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
ACM Transactions on Knowledge Discovery from Data (TKDD)
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)
New insights on internet streaming and IPTV
CIVR '08 Proceedings of the 2008 international conference on Content-based image and video retrieval
The Kinetic Facility Location Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
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
A hybrid spatial data clustering method for site selection: The data driven approach of GIS mining
Expert Systems with Applications: An International Journal
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
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms
An approximation algorithm to the k-Steiner Forest problem
Theoretical Computer Science
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Monotone Covering Problems with an Additional Covering Constraint
Mathematics of Operations Research
Exceeding expectations and clustering uncertain data
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Return of the primal-dual: distributed metric facilitylocation
Proceedings of the 28th ACM symposium on Principles of distributed computing
Adaptive Sampling for k-Means Clustering
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Load-balanced agent activation for value-added network services
Computer Communications
Incremental improvement of voltage assignment
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
The Fault-Tolerant Facility Allocation Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A simple and deterministic competitive algorithm for online facility location
Information and Computation
The reverse greedy algorithm for the metric k-median problem
Information Processing Letters
A novel memory management scheme for residential gateways
Information Systems Frontiers
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
A new approximation algorithm for the multilevel facility location problem
Discrete Applied Mathematics
On the competitive ratio for online facility location
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
An approximation algorithm to the k-Steiner forest problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Capacitated domination problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Randomized priority algorithms
Theoretical Computer Science
Offline and online facility leasing
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
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
Lower-bounded facility location
ACM Transactions on Algorithms (TALG)
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
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
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
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
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
Winner-imposing strategyproof mechanisms for multiple facility location games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Contention-aware data caching in wireless multi-hop ad hoc networks
Journal of Parallel and Distributed Computing
Approximation Algorithms for Multicommodity Facility Location Problems
SIAM Journal on Discrete Mathematics
Online and incremental algorithms for facility location
ACM SIGACT News
Approximation algorithms for the Fault-Tolerant Facility Placement problem
Information Processing Letters
Minimizing movement in mobile facility location problems
ACM Transactions on Algorithms (TALG)
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
GIS enabled service site selection: Environmental analysis and beyond
Information Systems Frontiers
Fast bounding procedures for large instances of the Simple Plant Location Problem
Computers and Operations Research
Network-aware service placement and selection algorithms on large-scale overlay networks
Computer Communications
Topology construction for rural wireless mesh networks - a geometric approach
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Unconstrained and constrained fault-tolerant resource allocation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Primal-dual schema and lagrangian relaxation for the k-location-routing problem
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
Resource allocation for covering time varying demands
ESA'11 Proceedings of the 19th European conference on Algorithms
Centrality-driven scalable service migration
Proceedings of the 23rd International Teletraffic Congress
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
SIAM Journal on Computing
Approximation algorithms for 2-stage stochastic optimization problems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Further reflections on a theory for basic algorithms
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
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Geometric clustering to minimize the sum of cluster sizes
ESA'05 Proceedings of the 13th annual European conference on Algorithms
WAOA'05 Proceedings of the Third international conference on Approximation and Online 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
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
Euclidean prize-collecting steiner forest
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Prize-collecting steiner networks via iterative rounding
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Inventory and facility location models with market selection
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A primal-dual approximation algorithm for partial vertex cover: making educated guesses
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
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
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the placement of active monitor in IP network
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Order-preserving transformations and greedy-like algorithms
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
A stochastic location problem with applications to tele-diagnostic
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Improved approximation algorithms for the robust fault-tolerant facility location problem
Information Processing Letters
Cache placement in sensor networks under update cost constraint
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Approximation algorithms for the k-median problem
Efficient Approximation and Online Algorithms
Theoretical Computer Science
Oblivious medians via online bidding
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Prize-Collecting steiner network problems
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)
Grouping objects in multi-band images using an improved eigenvector-based algorithm
Mathematical and Computer Modelling: An International Journal
An approximation algorithm for the k-level stochastic facility location problem
Operations Research Letters
The k-level facility location game
Operations Research Letters
A cost-sharing method for an economic lot-sizing game
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
On the linear relaxation of the p-median problem
Discrete Optimization
On the p-median polytope of Y-free graphs
Discrete Optimization
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
An algorithm for online facility leasing
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Prize-collecting steiner network problems
ACM Transactions on Algorithms (TALG)
The effectiveness of lloyd-type methods for the k-means problem
Journal of the ACM (JACM)
Winner-imposing strategyproof mechanisms for multiple Facility Location games
Theoretical Computer Science
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
Theoretical Computer Science
Clustering under approximation stability
Journal of the ACM (JACM)
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
A suitable server placement for peer-to-peer live streaming
The Journal of Supercomputing
Approximation algorithm for uniform bounded facility location problem
Journal of Combinatorial Optimization
Approximation Algorithms for Integrated Distribution Network Design Problems
INFORMS Journal on Computing
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 (budgeted) node-weighted steiner problems
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Improved approximation algorithms for constrained fault-tolerant resource allocation
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
A Local Heuristic for Latency-Optimized Distributed Cloud Deployment
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
Adaptive Search-Based Service Migration with Virtual Moves in Clouds for Mobile Accesses
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
Journal of Combinatorial Optimization
| Hi-index | 0.01 |
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 logm) and O(m logm(L + log (n))) respectively, where n and m are the total number of vertices and edges in the underlying complete bipartite graph on cities and facilities. The main algorithmic ideas are a new extension of the primal-dual schema and the use of Lagrangian relaxation to derive approximation algorithms.