| Article ID: | iaor20003720 |
| Country: | Singapore |
| Volume: | 15 |
| Issue: | 2 |
| Start Page Number: | 169 |
| End Page Number: | 177 |
| Publication Date: | Nov 1998 |
| Journal: | Asia-Pacific Journal of Operational Research |
| Authors: | Kellerer Hans, Wirsching Gnther |
| Keywords: | graphs |
We present new lower bounds on the bandwidth problem of undirected graphs. The results are applied to special bottleneck quadratic assignment problems.