Pages that link to "Item:Q2436659"
From MaRDI portal
The following pages link to Minimum diameter cost-constrained Steiner trees (Q2436659):
Displaying 10 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- Minimum diameter vertex-weighted Steiner tree (Q2039644) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- Finding cheapest deadline paths (Q2695315) (← links)
- Diameter-constrained Steiner trees (Q2905280) (← links)
- Diameter-Constrained Steiner Tree (Q3066462) (← links)
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees (Q3157034) (← links)
- (Q3640350) (← links)
- (Q5501297) (← links)
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic (Q6066592) (← links)