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...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 511; s. 23 - 31
Hlavní autori:	Fürer, Martin, Gaspers, Serge, Kasiviswanathan, Shiva Prasad
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 04.11.2013
Predmet:	Approximation algorithm Bucket decomposition Exponential time algorithm Graph bandwidth Graph bandwidth Bucket decomposition Approximation algorithm Exponential time algorithm
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!