Pages that link to "Item:Q1722966"
From MaRDI portal
The following pages link to Exact approaches for solving a covering problem with capacitated subtrees (Q1722966):
Displaying 8 items.
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem (Q2076862) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
- Connected bin packing problem on traceable graphs (Q3390778) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
- Finding minimum balanced separators -- an exact approach (Q6606653) (← links)