Pages that link to "Item:Q1278596"
From MaRDI portal
The following pages link to The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596):
Displayed 8 items.
- Fast algorithm for multicast and data gathering in wireless networks (Q963390) (← links)
- The bottleneck \(k\)-MST (Q1041824) (← links)
- Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
- Solving some lexicographic multi-objective combinatorial problems (Q1598728) (← links)
- A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death (Q1699920) (← links)
- Bridging \(k\)-sum and CVaR optimization in MILP (Q1722975) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)