Pages that link to "Item:Q1944200"
From MaRDI portal
The following pages link to Computing minimum diameter color-spanning sets is hard (Q1944200):
Displaying 11 items.
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- Shortest color-spanning intervals (Q896153) (← links)
- Approximation algorithms for color spanning diameter (Q1708269) (← links)
- Rainbow polygons for colored point sets in the plane (Q2032728) (← links)
- On the \(k\)-colored rainbow sets in fixed dimensions (Q2150582) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- On approximability of minimum color-spanning ball in high dimensions (Q2181229) (← links)
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points (Q2304571) (← links)
- On some matching problems under the color-spanning model (Q2319899) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- Online \(k\)-color spanning disk problems (Q6053966) (← links)
