Shortest color-spanning intervals

DOI10.1016/j.tcs.2015.01.039zbMath1333.68257OpenAlexW2067317999MaRDI QIDQ896153

Haitao Wang, Ming-Hui Jiang

Publication date: 11 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.039

zbMATH Keywords

computational geometryparameterized complexityexact algorithmscolor-spanning objects

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Efficiently approximating color-spanning balls ⋮ The approximation algorithms for a class of multiple-choice problem ⋮ Minimum color spanning circle of imprecise points ⋮ Color spanning objects: algorithms and hardness results ⋮ Color-spanning localized query

Cites Work

• Algorithms for interval structures with applications
• Representing a functional curve by curves with fewer peaks
• Dominating set is fixed parameter tractable in claw-free graphs
• On the parameterized complexity of multiple-interval graph problems
• Computing minimum diameter color-spanning sets is hard
• On some geometric problems of color-spanning sets
• Tight Approximation Bounds for Connectivity with a Color-Spanning Set
• Computing the Smallest Color-Spanning Axis-Parallel Square
• Computing Minimum Diameter Color-Spanning Sets
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• Unnamed Item

This page was built for publication: Shortest color-spanning intervals