Shortest color-spanning intervals
DOI10.1016/J.TCS.2015.01.039zbMATH Open1333.68257OpenAlexW2067317999MaRDI QIDQ896153FDOQ896153
Authors: Haitao Wang, Minghui 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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Computing the smallest color-spanning axis-parallel square
- Title not available (Why is that?)
- 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
- Computing minimum diameter color-spanning sets
- Representing a functional curve by curves with fewer peaks
- SMALLEST COLOR-SPANNING OBJECT REVISITED
- Algorithms for interval structures with applications
- Dominating set is fixed parameter tractable in claw-free graphs
- Tight approximation bounds for connectivity with a color-spanning set
Cited In (7)
- Color-spanning localized query
- Efficiently approximating color-spanning balls
- Algorithms for interval structures with applications
- Minimum color spanning circle of imprecise points
- The approximation algorithms for a class of multiple-choice problem
- Color spanning objects: algorithms and hardness results
- Algorithms for interval structures with applications
This page was built for publication: Shortest color-spanning intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896153)
