On some geometric problems of color-spanning sets

DOI10.1007/s10878-012-9458-yzbMath1275.90080OpenAlexW2133705739MaRDI QIDQ2392733

Wenqi Ju, Binhai Zhu, Chenglin Fan, Ovidiu Daescu, Jun Luo

Publication date: 2 August 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9458-y

zbMATH Keywords

computational geometryNP completecolor-spanning set

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (15)

On the \(k\)-colored rainbow sets in fixed dimensions ⋮ The approximation algorithms for a class of multiple-choice problem ⋮ An Approximation Algorithm for the Smallest Color-Spanning Circle Problem ⋮ Minimum color spanning circle of imprecise points ⋮ Online \(k\)-color spanning disk problems ⋮ Shortest color-spanning intervals ⋮ Minimum color spanning circle in imprecise setup ⋮ On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model ⋮ Minimum diameter color-spanning sets revisited ⋮ Rainbow polygons for colored point sets in the plane ⋮ A fully polynomial time approximation scheme for the smallest diameter of imprecise points ⋮ On some matching problems under the color-spanning model ⋮ Multi-colored spanning graphs ⋮ Expected computations on color spanning sets ⋮ On Some Proximity Problems of Colored Sets

Cites Work

• Average case analysis of dynamic geometric optimization
• An efficient algorithm for determining the convex hull of a finite planar set
• Computing Minimum Diameter Color-Spanning Sets
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some geometric problems of color-spanning sets