Elsevier < Decision Sciences Publications < Handbooks in Operations Research and Management Science < Volume 8: Network Routing < Chapter 8

NETWORK ROUTING
Edited by M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser

CHAPTER 8
VLS1 Network Design
R.H. Mohring, D. Wagner and E Wagner

Introduction

Part I. The General Layout Problem
 
1. Layout by graph partitioning*  

2. The divide-and-conquer layout algorithm

3. Bifurcators and separators

4. Bipartitioning

Part II. Routing
 
5. From planar graphs to switchboxes

6. Channel routing in the knock-knee mode

7. Layer assignment

8. Manhattan routing

9. Via minimization

10. Single layer routing

Part III. Linear Layout Methods
 
11. The VI-SI background

12. Graph-theoretic formulations and related problems

13. Complexity results

14. Algorithms

References

* The first two pages of the chapters are available as PDF file.

 Complete chapters on ScienceDirect

[Description and order information]

Important links:

• Member Order Form
  
• Proposals for further Handbook Volumes
  

Related Websites:

• Decision Sciences Publications
• Handbooks in Information Systems
• Handbooks in Economics
• Handbooks in Finance

<< back