scientific article; zbMATH DE number 1538069

zbMATH Open0965.68109MaRDI QIDQ4518929FDOQ4518929

Authors: Rajat Kumar Pal 

Publication date: 3 December 2000

Title of this publication is not available (Why is that?)

Recommendations

• Algorithmic aspects of VLSI layout.
• Nearly optimal algorithms and bounds for multilayer channel routing
• scientific article; zbMATH DE number 4077133
• scientific article; zbMATH DE number 4037776
• VLSI physical design. From graph partitioning to timing closure

zbMATH Keywords

computational complexitydesign of algorithmsmulti-layer channel routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer science aspects of computer-aided design (68U07)

Cited In (8)

• Packet Routing: Complexity and Algorithms
• Algorithms – ESA 2004
• Title not available (Why is that?)
• Direct routing: Algorithms and complexity
• Title not available (Why is that?)
• Channel routing in a diagonal overlap model
• Hexagonal three-layer channel routing
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518929)