Color spanning objects: algorithms and hardness results
From MaRDI portal
Recommendations
Cites work
- A kernelization algorithm for \(d\)-hitting set
- Algorithms for interval structures with applications
- Computing the smallest color-spanning axis-parallel square
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Incompressibility through Colors and IDs
- Shortest color-spanning intervals
- SMALLEST COLOR-SPANNING OBJECT REVISITED
- Smallest color-spanning objects
- The upper envelope of Voronoi surfaces and its applications
- Voronoi diagram for services neighboring a highway
Cited in
(7)
This page was built for publication: Color spanning objects: algorithms and hardness results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2795933)