Pages that link to "Item:Q5181099"
From MaRDI portal
The following pages link to Cost-minimal trees in directed acyclic graphs (Q5181099):
Displayed 7 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)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
- The Performance of greedy algorithms for the on-line steiner tree and related problems (Q4850333) (← links)