"Near-Optimal Algorithms for Point-Line Covering Problems."

Jianer Chen et al. (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2022.21

access: open

type: Conference or Workshop Paper

metadata version: 2022-03-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/ChenHKX22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/ChenHKX22
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-Optimal Algorithms for Point-Line Covering Problems. STACS 2022: 21:1-21:18

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.