Pages that link to "Item:Q1589434"
From MaRDI portal
The following pages link to Generalized submodular cover problems and applications (Q1589434):
Displaying 25 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- On some network design problems with degree constraints (Q355516) (← links)
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- The fault-tolerant capacitated \(K\)-center problem (Q484314) (← links)
- Approximating source location and star survivable network problems (Q528470) (← links)
- Capacitated domination problem (Q534769) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- A note on two source location problems (Q1018105) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
- Finding bounded diameter minimum spanning tree in general graphs (Q2147109) (← links)
- The minimum shift design problem (Q2468734) (← links)
- Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
- Approximating subdense instances of covering problems (Q2840726) (← links)
- An algorithmic framework for solving geometric covering problems -- with applications (Q2929639) (← links)
- ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM (Q3007757) (← links)
- Network-Design with Degree Constraints (Q3088102) (← links)
- Analysis of the greedy approach in problems of maximum \(k\)-coverage (Q4255028) (← links)
- Minimum-diameter covering problems (Q4520238) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)