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
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
On the bidirected cut relaxation for the metric Steiner tree problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
RNC-Approximation Algorithms for the Steiner Problem
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
The primal-dual schema, a general algorithm design method, has yielded approximation algorithms for a diverse collection of NP-hard problems. Perhaps its most remarkable feature is that despite its generality, it has yielded algorithms with good approximation guarantees as well as good running times. This survey provides some insights into how this comes about as well as a discussion on future work.