River Routing with a Small Number of Jogs

DOI10.1137/0403052zbMath0711.05021OpenAlexW2028265726MaRDI QIDQ3495374

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

optimizationpolynomial algorithmdynamic programming algorithmplacementone-layer wiring problemPERT analysisriver routing problem

Mathematics Subject Classification ID

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

Related Items (2)

Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing ⋮ Single jog minimum area joining of compacted cells

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