Pages that link to "Item:Q255267"
From MaRDI portal
The following pages link to When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267):
Displaying 7 items.
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
- Bounded-diameter minimum-cost graph problems (Q2464340) (← links)
- Diameter-constrained Steiner trees (Q2905280) (← links)
- Diameter-Constrained Steiner Tree (Q3066462) (← links)
- Delay-constrained minimum shortest path trees and related problems (Q5925589) (← links)