Primal-dual schema based approximation algorithms

  • Authors:
  • Vijay V. Vazirani

  • Affiliations:
  • College of Computing, Georgia Institute of Technology, Atlanta, GA

  • Venue:
  • Theoretical aspects of computer science
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.