Pages that link to "Item:Q5181099"
From MaRDI portal
The following pages link to Cost-minimal trees in directed acyclic graphs (Q5181099):
Displayed 13 items.
- Linear bounds for on-line Steiner problems (Q672394) (← links)
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- Optimal implementation of selectors in a data-base (Q1166277) (← links)
- The rectilinear Steiner arborescence problem (Q1186802) (← links)
- Delay-related secondary objectives for rectilinear Steiner minimum trees. (Q1427185) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (Q3449515) (← links)
- The Performance of greedy algorithms for the on-line steiner tree and related problems (Q4850333) (← links)
- Greedy algorithms for the on-line steiner tree and generalized steiner problems (Q5060154) (← links)
- Dynamic programming approach to the generalized minimum Manhattan network problem (Q5918463) (← links)
- Steiner problems on directed acyclic graphs (Q6183625) (← links)