Approximation algorithms for color spanning diameter
From MaRDI portal
Recommendations
Cites work
Cited in
(12)- A color-to-spin domino Schensted algorithm
- On the \(k\)-colored rainbow sets in fixed dimensions
- Computing minimum diameter color-spanning sets
- The approximation algorithms for a class of multiple-choice problem
- Online \(k\)-color spanning disk problems
- The 2-mixed-center color spanning problem
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
- On approximability of minimum color-spanning ball in high dimensions
- Solving the chromatic cone clustering problem via minimum spanning sphere
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- Minimum diameter color-spanning sets revisited
- On some proximity problems of colored sets
This page was built for publication: Approximation algorithms for color spanning diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708269)