Pages that link to "Item:Q679453"
From MaRDI portal
The following pages link to A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453):
Displayed 9 items.
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- (Q2709886) (← links)
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
- (Q5708491) (← links)