The following pages link to (Q3907583):
Displaying 12 items.
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- Steiner problem in Halin networks (Q1092013) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- Path-distance heuristic for the Steiner problem in undirected networks (Q1186805) (← links)
- Heuristics for the Steiner problem in graphs (Q1199447) (← links)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772) (← links)
- A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
- A data structure for bicategories, with application to speeding up an approximation algorithm (Q1342258) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes (Q5302069) (← links)
