Color Spanning Objects: Algorithms and Hardness Results
From MaRDI portal
Publication:2795933
DOI10.1007/978-3-319-29221-2_4zbMath1437.68180OpenAlexW2400805839MaRDI QIDQ2795933
Neeldhara Misra, Sandip Banerjee, Subhas C. Nandy
Publication date: 23 March 2016
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_4
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for interval structures with applications
- A kernelization algorithm for \(d\)-hitting set
- Voronoi diagram for services neighboring a highway
- The upper envelope of Voronoi surfaces and its applications
- Computing the Smallest Color-Spanning Axis-Parallel Square
- Shortest Color-Spanning Intervals
- Incompressibility through Colors and IDs
- SMALLEST COLOR-SPANNING OBJECT REVISITED
This page was built for publication: Color Spanning Objects: Algorithms and Hardness Results