"Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is ..."

Tibor Szkaliczki (1999)

> Home

Details and statistics

DOI: 10.1137/S0097539796303123

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Szkaliczki99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Szkaliczki99
Tibor Szkaliczki:
Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is NP-Complete. SIAM J. Comput. 29(1): 274-287 (1999)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.