Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data (PUB-856)

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data (2024) is listed in the DePaul Resource Map with a link to the published version (Algorithmica).

PUB-856 · 2024 · Algorithmica¹

DOI

Publication landing page: authors, related facilities, grants, and sources.

Authors

• Iyad Kanj (author)¹

Related facilities

• No facility links in records.

Related grants

• No grant links in records.

Sources

1. Named in published work. Archived source retained by Resource Map maintainers. View current source