Pages that link to "Item:Q2089871"
From MaRDI portal
The following pages link to Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871):
Displaying 5 items.
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156) (← links)
- Automata, Languages and Programming (Q5466515) (← links)