Affiliation:
1. University of Toronto, Canada
2. Altera Corporation, Canada
Abstract
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is defined syntactically and without any complexity limitations and hence our approximation bounds are independent of the
P
versus
NP
question. Using the stack model, we bound the performance of a broad class 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.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Reference62 articles.
1. Off-line Admission Control for Advance Reservations in Star Networks
2. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
3. Akcoglu K. Aspnes J. Dasgupta B. and Kao M.-Y. 2000. Opportunity cost algorithms for combinatorial auctions. CoRR cs.CE/0010031 143--167. Akcoglu K. Aspnes J. Dasgupta B. and Kao M.-Y. 2000. Opportunity cost algorithms for combinatorial auctions. CoRR cs.CE/0010031 143--167.
4. Toward a Model for Backtracking and Dynamic Programming
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献