Pages that link to "Item:Q489734"
From MaRDI portal
The following pages link to Algorithms for the minimum diameter terminal Steiner tree problem (Q489734):
Displaying 5 items.
- Minimum diameter vertex-weighted Steiner tree (Q2039644) (← links)
- A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (Q2165256) (← links)
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs (Q2185812) (← links)
- A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
