The following pages link to (Q4694752):
Displaying 24 items.
- The relation of connected set cover and group Steiner tree (Q441864) (← links)
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Complexity of the minimum-length corridor problem (Q876503) (← links)
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- On graphs preserving rectilinear shortest paths in the presence of obstacles (Q1179762) (← links)
- Solving group Steiner problems as Steiner problems. (Q1420439) (← links)
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Blocking for external graph searching (Q1920428) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
- How to sort by walking and swapping on paths and trees (Q2408166) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Some formulations for the group Steiner tree problem (Q2500536) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- Related axis: the extension to XPath towards effective XML search (Q2637268) (← links)
- (Q5708500) (← links)
- General variable neighborhood search approach to group Steiner tree problem (Q6063507) (← links)
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)
