Pages that link to "Item:Q1708269"
From MaRDI portal
The following pages link to Approximation algorithms for color spanning diameter (Q1708269):
Displaying 9 items.
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- Minimum diameter color-spanning sets revisited (Q2010932) (← links)
- On the \(k\)-colored rainbow sets in fixed dimensions (Q2150582) (← 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)
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (Q3196382) (← links)
- A color-to-spin domino Schensted algorithm (Q5934079) (← links)
- Online \(k\)-color spanning disk problems (Q6053966) (← links)
- The 2-mixed-center color spanning problem (Q6606233) (← links)