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-case O(1.9797...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 511; pp. 23 - 31
Main Authors:	Fürer, Martin, Gaspers, Serge, Kasiviswanathan, Shiva Prasad
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 04.11.2013
Subjects:	Approximation algorithm Bucket decomposition Exponential time algorithm Graph bandwidth Graph bandwidth Bucket decomposition Approximation algorithm Exponential time algorithm
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!