Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing
From MaRDI portal
Publication:917314
DOI10.1016/0020-0190(90)90067-8zbMath0704.68060MaRDI QIDQ917314
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90067-8
68Q25: Analysis of algorithms and problem complexity
68W10: Parallel algorithms in computer science
94C99: Circuits, networks
Related Items
Cites Work