Approximating the Bandwidth via Volume Respecting Embeddings
- 1 June 2000
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 60 (3), 510-539
- https://doi.org/10.1006/jcss.1999.1682
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995
- Bandwidth Minimization: An approximation algorithm for caterpillarsTheory of Computing Systems, 1991
- Computing the Bandwidth of Interval GraphsSIAM Journal on Discrete Mathematics, 1990
- Graphs with small bandwidth and cutwidthDiscrete Mathematics, 1989
- The Johnson-Lindenstrauss lemma and the sphericity of some graphsJournal of Combinatorial Theory, Series B, 1988
- On lipschitz embedding of finite metric spaces in Hilbert spaceIsrael Journal of Mathematics, 1985
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problemJournal of Algorithms, 1984
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2SIAM Journal on Algebraic Discrete Methods, 1981
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978