Coping with the NP-Hardness of the Graph Bandwidth Problem

@inproceedings{Feige2000CopingWT,
  title={Coping with the NP-Hardness of the Graph Bandwidth Problem},
  author={Uriel Feige},
  booktitle={SWAT},
  year={2000}
}
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. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 31 references

On the probable performance of heuristics for bandwidth minimization

  • J. Turner
  • SIAM J. Comput.,
  • 1986
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…