On Approximation Hardness of the Bandwidth Problem

TitleOn Approximation Hardness of the Bandwidth Problem
Publication TypeTechnical Report
Year of Publication1997
AuthorsKarpinski, M., & Wirtgen J.
Other Numbers1122
Abstract

The bandwidth problem is the problem of enumerating the vertices of a given graph G such that the maximum difference between the numbers of adjacent vertices is minimal. The problem has a long history and a number of applications and is known to be NP-hard, Papadimitriou [Pa 76]. There is not much known though on approximation hardness of this problem. In this paper we show, that there are no efficient polynomial time approximation schemes for the bandwidth problem under some plausible assumptions. Furthermore, we show that there are no polynomial time approximation algorithms with an absolute error guarantee of n^1-e for any e > 0 unless P = NP.

URLhttp://www.icsi.berkeley.edu/ftp/global/pub/techreports/1997/tr-97-060.pdf
Bibliographic Notes

ICSI Technical Report TR-97-060

Abbreviated Authors

M. Karpinski and J. Wirtgen

ICSI Publication Type

Technical Report