NP-Completeness of Spreading Colored Points

DOI10.1007/978-3-642-17458-2_5zbMath1310.68088OpenAlexW1781423765MaRDI QIDQ3066143

Ovidiu Daescu, Wenqi Ju, Jun Luo

Publication date: 8 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17458-2_5

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (6)

Minimum color spanning circle of imprecise points ⋮ Algorithms for interval structures with applications ⋮ Minimum color spanning circle in imprecise setup ⋮ New results on stabbing segments with a polygon ⋮ Algorithms for Interval Structures with Applications ⋮ Largest and smallest area triangles on imprecise points

This page was built for publication: NP-Completeness of Spreading Colored Points