Pages that link to "Item:Q2392733"
From MaRDI portal
The following pages link to On some geometric problems of color-spanning sets (Q2392733):
Displaying 15 items.
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Shortest color-spanning intervals (Q896153) (← links)
- Minimum diameter color-spanning sets revisited (Q2010932) (← 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)
- 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)
- Expected computations on color spanning sets (Q2343982) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- On Some Proximity Problems of Colored Sets (Q2867120) (← links)
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (Q3196382) (← links)
- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model (Q4632199) (← links)
- Online \(k\)-color spanning disk problems (Q6053966) (← links)
