"Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem ..."

Jianer Chen et al. (2024)

> Home

Details and statistics

DOI: 10.1007/S00453-024-01231-6

access: closed

type: Journal Article

metadata version: 2024-07-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ChenHKX24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ChenHKX24
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. Algorithmica 86(8): 2448-2478 (2024)

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.