Pages that link to "Item:Q4216142"
From MaRDI portal
The following pages link to Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic (Q4216142):
Displaying 6 items.
- NP-hardness of the Euclidean Max-Cut problem (Q471386) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
- Complexity of the weighted max-cut in Euclidean space (Q5264746) (← links)
- (Q5874473) (← links)
- Improved bounds for metric capacitated covering problems (Q6107884) (← links)
