"Touring Disjoint Polygons Problem Is NP-Hard."

Arash Ahadi, Amirhossein Mozafari, Alireza Zarei (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-319-03780-6_31

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoa/AhadiMZ13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/AhadiMZ13
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei:
Touring Disjoint Polygons Problem Is NP-Hard. COCOA 2013: 351-360

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.