Pages that link to "Item:Q4520238"
From MaRDI portal
The following pages link to Minimum-diameter covering problems (Q4520238):
Displayed 12 items.
- Group-based collective keyword querying in road networks (Q344558) (← links)
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- Hardness results for homology localization (Q633215) (← links)
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
- Parameterized complexity of team formation in social networks (Q1704854) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- Parameterized Complexity of Team Formation in Social Networks (Q2830065) (← links)
- ON RECTANGULAR COVERING PROBLEMS (Q3401889) (← links)
- (Q5136221) (← links)
- (Q5881545) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)