"Manhattan Channel Routing is NP-complete Under Truly Restricted Settings."

Martin Middendorf (1996)

Details and statistics

DOI:

access: open

type: Journal Article

metadata version: 2021-02-11

a service of  Schloss Dagstuhl - Leibniz Center for Informatics