Improved Performance Guarantees for Bandwidth Minimization Heuristics (1998) [4 citations — 0 self]
by
Uriel Feige
,
Robert Krauthgamer
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@TECHREPORT{Feige98improvedperformance,
author = {Uriel Feige and Robert Krauthgamer},
title = {Improved Performance Guarantees for Bandwidth Minimization Heuristics},
institution = {},
year = {1998}
}
author = {Uriel Feige and Robert Krauthgamer},
title = {Improved Performance Guarantees for Bandwidth Minimization Heuristics},
institution = {},
year = {1998}
}
Bookmarks
OpenURL
Abstract:
Introduction Given an undirected graph G = (V; E) on n vertices, a linear arrangement (also called ordering, numbering or layout) of the graph vertices is a one-toone mapping of the vertices to the integer line : V 7! f0; 1; 2; : : : ; n \Gamma 1g. The bandwidth of a linear arrangement is the dilation of longest edge in the arrangement, i.e. maxfj(u) \Gamma (v)j : (u; v) 2 Eg. The problem of minimizing the bandwidth of a graph is to find a linear arrangement for it with the minimum possible bandwidth. One motivation for the bandwidth problem is its equivalence to minimizing the bandwidth
