Approximation schemes for covering and packing problems in robotics and vlsi

Extended abstract
  • Dorit S. Hochbaum
  • Wolfgang Maass
Contibuted Papers

DOI: 10.1007/3-540-12920-0_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 166)
Cite this paper as:
Hochbaum D.S., Maass W. (1984) Approximation schemes for covering and packing problems in robotics and vlsi. In: Fontet M., Mehlhorn K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg

Abstract

The approach described in this paper, the shifting strategy, has proved useful in a large variety of contexts. Via the use of this approach we were able to derive algorithms that are the best possible in the sense that the exponential dependence on 1/ɛ cannot be removed unless NP=P. We also note that all other polynomial approximation schemes that we are familiar with rely on dynamic programming. The technique we introduced is an alternative to dynamic programming for the construction of polynomial approximation schemes for strongly NP-complete problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1984

Authors and Affiliations

  • Dorit S. Hochbaum
    • 1
  • Wolfgang Maass
    • 2
  1. 1.University of California, BerkeleyBerkeley
  2. 2.Department of Computer ScienceUniversity of California, BerkeleyBerkeley

Personalised recommendations