Dogleg Channel Routing is NP-Complete
- 1 January 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 4 (1) , 31-41
- https://doi.org/10.1109/tcad.1985.1270096
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Optimal Placement for River RoutingSIAM Journal on Computing, 1983
- An optimal solution to a wire-routing problemJournal of Computer and System Sciences, 1981
- New Lower Bounds for Channel WidthPublished by Springer Nature ,1981
- Optimal Routing in Rectilinear ChannelsPublished by Springer Nature ,1981
- Provably Good Channel Routing AlgorithmsPublished by Springer Nature ,1981
- The Separation for General Single-Layer Wiring BarriersPublished by Springer Nature ,1981
- Optimal wiring between rectanglesPublished by Association for Computing Machinery (ACM) ,1981
- A “Dogleg” channel routerPublished by Association for Computing Machinery (ACM) ,1976
- Wire routing by optimizing channel assignment within large aperturesPublished by Association for Computing Machinery (ACM) ,1971