On some geometric problems of color-spanning sets
From MaRDI portal
Publication:2392733
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
Recommendations
Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- An efficient algorithm for determining the convex hull of a finite planar set
- Title not available (Why is that?)
- Computational geometry. Algorithms and applications.
- Title not available (Why is that?)
- Computing minimum diameter color-spanning sets
- SMALLEST COLOR-SPANNING OBJECT REVISITED
- Title not available (Why is that?)
- Title not available (Why is that?)
- Average case analysis of dynamic geometric optimization
Cited In (31)
- Geometric spanners with small chromatic number
- On some proximity problems of colored sets
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
- Title not available (Why is that?)
- Online \(k\)-color spanning disk problems
- Solving the chromatic cone clustering problem via minimum spanning sphere
- Minimum diameter color-spanning sets revisited
- Color spanning objects: algorithms and hardness results
- Shortest color-spanning intervals
- The 2-mixed-center color spanning problem
- On some matching problems under the color-spanning model
- Geometric Spanners with Small Chromatic Number
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- Expected computations on color spanning sets
- Rainbow polygons for colored point sets in the plane
- Computing the smallest color-spanning axis-parallel square
- Expected computations on color spanning sets
- Minimum color spanning circle of imprecise points
- On the \(k\)-colored rainbow sets in fixed dimensions
- SMALLEST COLOR-SPANNING OBJECT REVISITED
- The approximation algorithms for a class of multiple-choice problem
- Color spanning objects: algorithms and hardness results
- Multi-colored spanning graphs
- Tight approximation bounds for connectivity with a color-spanning set
- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model
- On some geometric problems of color-spanning sets
- Minimum color spanning circle in imprecise setup
- On the minimum consistent subset problem
- Approximation algorithms for color spanning diameter
- Computing minimum diameter color-spanning sets
- Unit covering in color-spanning set model
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)
