The following pages link to (Q3046489):
Displaying 17 items.
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- On the approximability of dense Steiner problems (Q396661) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- On approximation algorithms for the terminal Steiner tree problem (Q1029037) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- (Q3304124) (← links)
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
- (Q5111735) (← links)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes (Q5302069) (← links)
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- Stronger path‐based extended formulation for the Steiner tree problem (Q6068530) (← links)
