A new polynomial-time algorithm for linear programming
Combinatorica
A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Probabilistic analysis of a relaxation for the k-median problem
Mathematics of Operations Research
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
P-Complete Approximation Problems
Journal of the ACM (JACM)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Theory for Memory-Based Learning
A Theory for Memory-Based Learning
A theory for memory-based learning
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theory and Practice of Vector Quantizers Trained on Small Training Sets
IEEE Transactions on Pattern Analysis and Machine Intelligence
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Analysis of greedy expert hiring and an application to memory-based learning (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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 schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Packet routing with arbitrary end-to-end delay requirements
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
Scheduling unrelated machines with costs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth 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
Network design and improvement
ACM Computing Surveys (CSUR)
K-medians, facility location, and the Chernoff-Wald bound
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Web caching using access statistics
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
Profit-earning facility location
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
Algorithms for provisioning virtual private networks in the hose model
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Improved algorithms for the data placement problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Algorithms for provisioning virtual private networks in the hose model
IEEE/ACM Transactions on Networking (TON)
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
Fault-tolerant facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem
Proceedings of the 8th 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
Budget Constrained Minimum Cost Connected Medians
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On Multicriteria Online Problems
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Optimal indexing using near-minimal space
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
Better streaming algorithms 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
Facility location with Service Installation Costs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A k-Median Algorithm with Running Time Independent of Data Size
Machine Learning
Approximating k-median with non-uniform capacities
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Weighted random sampling with a reservoir
Information Processing Letters
Allocation cost minimization for periodic hard real-time tasks in energy-constrained DVS systems
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Cut problems in graphs with a budget constraint
Journal of Discrete Algorithms
A constant factor approximation algorithm for k-median clustering with outliers
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fault-tolerant facility location
ACM Transactions on Algorithms (TALG)
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
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A case for hybrid sensor networks
IEEE/ACM Transactions on Networking (TON)
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Journal of Discrete Algorithms
A traffic engineering approach for placement and selection of network services
IEEE/ACM Transactions on Networking (TON)
Return of the primal-dual: distributed metric facilitylocation
Proceedings of the 28th ACM symposium on Principles of distributed computing
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
Weighted random sampling with a reservoir
Information Processing Letters
Approximation algorithms for bounded facility location
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Recurrent predictive models for sequence segmentation
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
Improved approximation algorithm for connected facility location problems
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
Scalable flow-based networking with DIFANE
Proceedings of the ACM SIGCOMM 2010 conference
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
Incremental Facility Location Problem and Its Competitive Algorithms
Journal of Combinatorial Optimization
Tree embeddings for two-edge-connected network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
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
On a bounded budget network creation game
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Platform synthesis and partitioning of real-time tasks for energy efficiency
Journal of Systems Architecture: the EUROMICRO Journal
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
Unconstrained and constrained fault-tolerant resource allocation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Constant factor approximation algorithm for the knapsack median problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Data reduction for weighted and outlier-resistant clustering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A new template for solving p-median problems for trees in sub-quadratic time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
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
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Scheduling on unrelated machines under tree-like precedence constraints
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
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Approximation algorithms for the k-median problem
Efficient Approximation and Online Algorithms
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
Oblivious medians via online bidding
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Fault-tolerant facility location: a randomized dependent LP-Rounding algorithm
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Operations Research Letters
Selfish overlay network creation and maintenance
IEEE/ACM Transactions on Networking (TON)
A survey on offline scheduling with rejection
Journal of Scheduling
Approximating k-median via pseudo-approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Approximating the reliable resource allocation problem using inverse dual fitting
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
The Gateway Location Problem: Assessing the impact of candidate site selection policies
Discrete Applied Mathematics
| Hi-index | 0.00 |
We present efficient new randomized and deterministic methods for transforming optimal solutions for a type of relaxed integer linear program into provably good solutions for the corresponding NP-hard discrete optimization problem. Without any constraint violation, the &egr;-approximation problem for many problems of this type is itself NP-hard. Our methods provide polynomial-time &egr;-approximations while attempting to minimize the packing constraint violation.Our methods lead to the first known approximation algorithms with provable performance guarantees for the s-median problem, the tree prunning problem, and the generalized assignment problem. These important problems have numerous applications to data compression, vector quantization, memory-based learning, computer graphics, image processing, clustering, regression, network location, scheduling, and communication. We provide evidence via reductions that our approximation algorithms are nearly optimal in terms of the packing constraint violation. We also discuss some recent applications of our techniques to scheduling problems.