On some geometric problems of color-spanning sets

DOI10.1007/S10878-012-9458-YzbMATH Open1275.90080OpenAlexW2133705739MaRDI QIDQ2392733FDOQ2392733

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

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

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

Recommendations

• On some geometric problems of color-spanning sets
• Minimum diameter color-spanning sets revisited
• On some proximity problems of colored sets
• Expected computations on color spanning sets
• Computing minimum diameter color-spanning sets

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1256643 (Why is no real title available?)
• scientific article; zbMATH DE number 1786519 (Why is no real title available?)
• scientific article; zbMATH DE number 1875422 (Why is no real title available?)
• An efficient algorithm for determining the convex hull of a finite planar set
• Average case analysis of dynamic geometric optimization
• Computational geometry. Algorithms and applications.
• Computing minimum diameter color-spanning sets
• SMALLEST COLOR-SPANNING OBJECT REVISITED

Cited in

(30)

• On the \(k\)-colored rainbow sets in fixed dimensions
• Computing minimum diameter color-spanning sets
• Geometric Spanners with Small Chromatic Number
• Geometric spanners with small chromatic number
• Unit covering in color-spanning set model
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• The approximation algorithms for a class of multiple-choice problem
• Rainbow polygons for colored point sets in the plane
• Online \(k\)-color spanning disk problems
• Color spanning objects: algorithms and hardness results
• The 2-mixed-center color spanning problem
• An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
• On some matching problems under the color-spanning model
• Expected computations on color spanning sets
• Tight approximation bounds for connectivity with a color-spanning set
• Computing the smallest color-spanning axis-parallel square
• Solving the chromatic cone clustering problem via minimum spanning sphere
• A fully polynomial time approximation scheme for the smallest diameter of imprecise points
• Expected computations on color spanning sets
• Color spanning objects: algorithms and hardness results
• On some geometric problems of color-spanning sets
• On the minimum consistent subset problem
• Approximation algorithms for color spanning diameter
• scientific article; zbMATH DE number 1875422 (Why is no real title available?)
• Shortest color-spanning intervals
• Minimum diameter color-spanning sets revisited
• On the fixed-parameter tractability of some matching problems under the color-spanning model
• Minimum color spanning circle in imprecise setup
• Minimum color spanning circle of imprecise points
• On some proximity problems of colored sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392733)