Pages that link to "Item:Q3587360"
From MaRDI portal
The following pages link to Computing Minimum Diameter Color-Spanning Sets (Q3587360):
Displaying 15 items.
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- Algorithms for interval structures with applications (Q388095) (← links)
- Shortest color-spanning intervals (Q896153) (← links)
- Computing minimum diameter color-spanning sets is hard (Q1944200) (← links)
- Minimum diameter color-spanning sets revisited (Q2010932) (← links)
- On some matching problems under the color-spanning model (Q2319899) (← links)
- Expected computations on color spanning sets (Q2343982) (← links)
- On some geometric problems of color-spanning sets (Q2392733) (← links)
- On Some Proximity Problems of Colored Sets (Q2867120) (← links)
- On Some Geometric Problems of Color-Spanning Sets (Q3004661) (← links)
- Algorithms for Interval Structures with Applications (Q3004669) (← 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)
- The 2-mixed-center color spanning problem (Q6606233) (← links)
