"Minimum constraint removal problem for line segments is NP-hard."

Bahram Sadeghi Bigham (2023)

> Home

Details and statistics

DOI: 10.1142/S1793830922500550

access: closed

type: Journal Article

metadata version: 2023-04-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dmaa/Bigham23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmaa/Bigham23
Bahram Sadeghi Bigham:
Minimum constraint removal problem for line segments is NP-hard. Discret. Math. Algorithms Appl. 15(1): 2250055:1-2250055:10 (2023)

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.