"NP-Completeness and an Approximation Algorithm for Rectangle Escape ..."

Qiang Ma, Martin D. F. Wong (2012)

> Home

Details and statistics

DOI: 10.1109/TCAD.2012.2193581

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcad/0002W12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcad/0002W12
Qiang Ma, Martin D. F. Wong:
NP-Completeness and an Approximation Algorithm for Rectangle Escape Problem With Application to PCB Routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 31(9): 1356-1365 (2012)

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.