Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
Introduction to 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
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
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
Discrete Applied Mathematics - Special volume on computational molecular biology
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved performance of the greedy algorithm for partial cover
Information Processing Letters
A unified approximation algorithm for node-deletion problems
Discrete Applied Mathematics
Approximating clique and biclique problems
Journal of Algorithms
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Page replacement for general caching problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Using homogeneous weights for approximating the partial cover problem
Journal of Algorithms
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computational Complexity of Machine Learning
Computational Complexity of Machine Learning
Graph Algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Throughput maximization of real-time scheduling with batching
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Approximation Algorithm for Feedback Vertex Sets in Tournaments
SIAM Journal on Computing
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments
SIAM Journal on Computing
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Worst-case analysis of memory allocation algorithms
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic aspects of bandwidth trading
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Local ratio with negative weights
Operations Research Letters
The minimum generalized vertex cover problem
ACM Transactions on Algorithms (TALG)
Admission control with advance reservations in simple networks
Journal of Discrete Algorithms
Frugality ratios and improved truthful mechanisms for vertex cover
Proceedings of the 8th ACM conference on Electronic commerce
Extracting constrained 2-interval subsets in 2-interval sets
Theoretical Computer Science
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Elementary approximation algorithms for prize collecting Steiner tree problems
Information Processing Letters
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
A Novel Approximate Algorithm for Admission Control
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Approximation of partial capacitated vertex cover
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Distributed fractional packing and maximum weighted b-matching via tail-recursive duality
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
SIAM Journal on Computing
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Improved approximation algorithm for convex recoloring of trees
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Theoretical Computer Science
Combination of parallel machine scheduling and vertex cover
Theoretical Computer Science
A note on multicovering with disks
Computational Geometry: Theory and Applications
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs
Information and Computation
Journal of Discrete Algorithms
Efficient location-based decision-supporting content distribution to mobile groups
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
The local ratio technique is a methodology for the design and analysis of algorithms for a broad range of optimization problems. The technique is remarkably simple and elegant, and yet can be applied to several classical and fundamental problems (including covering problems, packing problems, and scheduling problems). The local ratio technique uses elementary math and requires combinatorial insight into the structure and properties of the problem at hand. Typically, when using the technique, one has to invent a weight function for a problem instance under which every "reasonable" solution is "good." The local ratio technique is closely related to the primal-dual schema, though it is not based on weak LP duality (which is the basis of the primal-dual approach) since it is not based on linear programming.In this survey we, introduce the local ratio technique and demonstrate its use in the design and analysis of algorithms for various problems. We trace the evolution path of the technique since its inception in the 1980's, culminating with the most recent development, namely, fractional local ratio, which can be viewed as a new LP rounding technique.