"The Via Minimization Problem is NP-Complete."

Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima (1989)

> Home

Details and statistics

DOI: 10.1109/12.42135

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  authority control:
- export record
  dblp key:
  - journals/tc/NaclerioMN89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/NaclerioMN89
Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima:
The Via Minimization Problem is NP-Complete. IEEE Trans. Computers 38(11): 1604-1608 (1989)

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.