Color spanning objects: algorithms and hardness results

DOI10.1016/j.dam.2018.02.014zbMath1437.68181OpenAlexW2790667701WikidataQ130063488 ScholiaQ130063488MaRDI QIDQ2181240

Subhas C. Nandy, Neeldhara Misra, Sandip Banerjee

Publication date: 18 May 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.02.014

zbMATH Keywords

computational geometryparameterized complexityexact algorithmscolor spanning sets

Mathematics Subject Classification ID

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
• Unnamed Item
• Unnamed Item
• Algorithms for interval structures with applications
• On miniaturized problems in parameterized complexity theory
• Largest and smallest convex hulls for imprecise points
• Shortest color-spanning intervals
• A kernelization algorithm for \(d\)-hitting set
• The upper envelope of Voronoi surfaces and its applications
• Iterative compression and exact algorithms
• Computing the Smallest Color-Spanning Axis-Parallel Square
• The Lost Continent of Polynomial Time: Preprocessing and Kernelization
• Incompressibility through Colors and IDs
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• Parameterized Algorithms

This page was built for publication: Color spanning objects: algorithms and hardness results