"On the Complexity of and Algorithms for Min-Max Target Coverage On a Line ..."

Peihuang Huang, Wenxing Zhu, Longkun Guo (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-14812-6_19

access: closed

type: Conference or Workshop Paper

metadata version: 2019-04-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tamc/HuangZG19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/HuangZG19
Peihuang Huang, Wenxing Zhu, Longkun Guo:
On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary. TAMC 2019: 313-324

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.