The following pages link to The polymatroid Steiner problems (Q2569165):
Displaying 7 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Adaptive Submodular Ranking and Routing (Q5130512) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
