Nearly time-optimal kernelization algorithms for the line-cover problem with big data
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 7692358 (Why is no real title available?)
- A parameterized algorithm for the hyperplane-cover problem
- Algorithmic graph embeddings
- Applications of incidence bounds in point covering problems
- Covering a Set of Points with a Minimum Number of Lines
- Cutting hyperplanes for divide-and-conquer
- Dynamic parameterized problems and algorithms
- Dynamic planar point location in optimal time
- Faster Update Time for Turnstile Streaming Algorithms
- Filling Crosswords is Very Hard
- Linear-time parameterized algorithms with limited local resources
- On randomized one-round communication complexity
- On the complexity of locating linear facilities in the plane
- Parameterized algorithms
- Point line cover: the easy kernel is essentially tight
- Space limited linear-time graph algorithms on big data
- Statistical Models
- Streaming kernelization
- Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
- Time lower bounds for nonadaptive turnstile streaming algorithms
- Towards a theory of parameterized streaming algorithms
- Towards an optimal method for dynamic planar point location
This page was built for publication: Nearly time-optimal kernelization algorithms for the line-cover problem with big data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586656)
