Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
A faster approximation algorithm for the Steiner problem in graphs
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
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A tight analysis of the greedy algorithm for set cover
Journal of Algorithms
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
On Syntactic versus Computational Views of Approximability
SIAM Journal on Computing
On the bidirected cut relaxation for the metric Steiner tree problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improvements in throughout maximization for real-time scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
The Probable Value of the Lovász-Schrijver Relaxations for Maximum Independent Set
SIAM Journal on Computing
Steiner trees in uniformly quasi-bipartite graphs
Information Processing Letters
Proving Integrality Gaps without Knowing the Linear Program
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Improved Approximation Algorithms for Resource Allocation
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Simple Algorithms for a Weighted Interval Selection Problem
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Toward a Model for Backtracking and Dynamic Programming
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Tighter Bounds for Graph Steiner Tree Approximation
SIAM Journal on Discrete Mathematics
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
SIAM Journal on Discrete Mathematics
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Linear programming relaxations of maxcut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The Steiner tree problem on graphs: Inapproximability results
Theoretical Computer Science
Throughput maximization of real-time scheduling with batching
ACM Transactions on Algorithms (TALG)
Resource Allocation in Bounded Degree Trees
Algorithmica
Integrality gaps for Sherali-Adams relaxations
Proceedings of the forty-first annual ACM symposium on Theory of computing
Models of Greedy Algorithms for Graph Problems
Algorithmica
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
New geometry-inspired relaxations and algorithms for the metric steiner tree problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Improving integrality gaps via Chvátal-Gomory rounding
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A partition-based relaxation for Steiner trees
Mathematical Programming: Series A and B
A Stronger Model of Dynamic Programming Algorithms
Algorithmica
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász-Schrijver Hierarchy
SIAM Journal on Computing
Off-line admission control for advance reservations in star networks
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Hypergraphic LP relaxations for steiner trees
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
| Hi-index | 0.00 |
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.