River Routing with a Small Number of Jogs

DOI10.1137/0403052MaRDI QIDQ3495374zbMATH OpenOpenAlexFDO

Authors Tai-Ching Tuan, S. Louis Hakimi

Publication date 1990

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0403052

zbMATH Keywords

dynamic programming algorithmone-layer wiring problemoptimizationPERT analysisplacementpolynomial algorithmriver routing problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Applications of graph theory to circuits and networks (94C15)

Recommendations

• River routing with a generalized model
• Optimal Placement for River Routing
• scientific article; zbMATH DE number 3958751
• Some Geometry for General River Routing
• Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing
• River routing in VLSI
• River landscapes and optimal channel networks
• Generalized river crossing problems
• The minimum time problem of crossing river with restricted conditions
• Using River Formation Dynamics to Design Heuristic Algorithms

Cited in

(12)

• River routing in VLSI
• The benefits of external wires in single row routing
• Single bend wiring on surfaces
• scientific article; zbMATH DE number 1696838 (Why is no real title available?)
• Optimal Placement for River Routing
• scientific article; zbMATH DE number 3958751 (Why is no real title available?)
• Single bend wiring
• Some Geometry for General River Routing
• Offset range problem for two blocks
• River routing with a generalized model
• Single jog minimum area joining of compacted cells
• Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing

This page was built for publication: River Routing with a Small Number of Jogs

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