Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998
From MaRDI portal
Publication:1572590
zbMath0940.00071MaRDI QIDQ1572590
No author found.
Publication date: 12 July 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://www.sciencedirect.com/science/article/pii/S0304397599001796/pdf
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Festschriften (00B30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with small bandwidth and cutwidth
- Geometric algorithms and combinatorial optimization
- The NP-completeness of the bandwidth minimization problem
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- The bandwidth problem for graphs and matrices—a survey
- Bandwidth Minimization: An approximation algorithm for caterpillars
- Complexity Results for Bandwidth Minimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- A remark on a problem of Harary
- Approximating the bandwidth for asteroidal triple-free graphs
This page was built for publication: Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998