An Exponential Time 2-Approximation Algorithm for Bandwidth

The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by at most b. In this paper, we present a 2-approximation algorithm for the Bandwidth problem that takes worst

• Type: Conference
• Year: 2009
• Where: IWPEC
• Authors: Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
• Keywords: Adjacent Vertices, Applied Computing, IWPEC 2009, Labels