Coping with the NP-Hardness of the Graph Bandwidth Problem

  • Uriel Feige
Conference paper

DOI: 10.1007/3-540-44985-X_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1851)
Cite this paper as:
Feige U. (2000) Coping with the NP-Hardness of the Graph Bandwidth Problem. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg

Abstract.

We review several approaches of coping with NP-hardness, and see how they apply (if at all) to the problem of computing the bandwidth of a graph.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Uriel Feige
    • 1
  1. 1.Weizmann InstituteRehovotIsrael

Personalised recommendations