Approximating the bandwidth via volume respecting embeddings (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum difference between two numbers of adjacent vertices is minimal. The problem is known to be NP-complete and there are only few algorithms for rather special cases of the problem [HaMaMo91] [Kra87] [Sax80] [Smi95]. In this paper we present a randomized 3-approximation algorithm for the bandwidth problem restricted to dense graphs and a randomized 2-approximation algorithm for the same problem on directed dense graphs.