The following pages link to Diameter-Constrained Steiner Tree (Q3066462):
Displaying 13 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- Minimum diameter vertex-weighted Steiner tree (Q2039644) (← 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)
- An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs (Q2819269) (← links)
- Diameter-constrained Steiner trees (Q2905280) (← links)
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees (Q3157034) (← links)
- Vertex fusion under diameter constraints (Q3503481) (← links)
- Dynamic Steiner Tree Problem (Q3977293) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)