Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
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
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the bidirected cut relaxation for the metric Steiner tree problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Proving Integrality Gaps without Knowing the Linear Program
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On the Approximability of the Steiner Tree Problem
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
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
Models of greedy algorithms for graph problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
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
Randomized priority algorithms
Theoretical Computer Science
On the limitations of Greedy mechanism design for truthful combinatorial auctions
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Towards a theory of algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We define an algorithmic paradigm, the stack model, that captures most primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is defined syntactically and without any complexity limitations. Hence our approximation bounds are independent of the P vs NP question. We provide tools to bound the performance of primal dual and local ratio algorithms and supply a (log n+1)/2 inapproximability result for set-cover, a 4/3 inapproximability for min steiner tree, and a 0.913 inapproximability for interval scheduling on two machines.