The following pages link to (Q4234152):
Displaying 4 items.
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)