"Covering oriented points in the plane with orthogonal polygons is NP-complete."

Cem Evrendilek, Burkay Genç, Brahim Hnich (2010)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2010.05.039

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/EvrendilekGH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/EvrendilekGH10
Cem Evrendilek, Burkay Genç, Brahim Hnich:
Covering oriented points in the plane with orthogonal polygons is NP-complete. Electron. Notes Discret. Math. 36: 303-310 (2010)

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.