Pages that link to "Item:Q5386209"
From MaRDI portal
The following pages link to Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems (Q5386209):
Displaying 14 items.
- An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- Steiner intervals, geodesic intervals, and betweenness (Q1045107) (← links)
- A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
- A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death (Q1699920) (← links)
- Some Steiner concepts on lexicographic products of graphs (Q2931926) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem (Q3512450) (← links)
- Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems (Q4571047) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings (Q5737814) (← links)
- Approximating node-weighted \(k\)-MST on planar graphs (Q5918856) (← links)
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)
- Approximation algorithm for the minimum partial connected Roman dominating set problem (Q6571270) (← links)
