scientific article; zbMATH DE number 219265
From MaRDI portal
Publication:4694752
Recommendations
Cited in
(35)- Approximation algorithms for group prize-collecting and location-routing problems
- On graphs preserving rectilinear shortest paths in the presence of obstacles
- Class Steiner trees and VLSI-design
- Rectilinear group Steiner trees and applications in VLSI design
- Solving group Steiner problems as Steiner problems.
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
- A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction
- Generalized network design problems.
- Blocking for external graph searching
- Computing directed Steiner path covers
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
- How to sort by walking and swapping on paths and trees
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Watchman routes for lines and line segments
- Some formulations for the group Steiner tree problem
- A greedy approximation algorithm for the group Steiner problem
- Related axis: the extension to XPath towards effective XML search
- Shortest paths and Steiner trees in VLSI routing
- scientific article; zbMATH DE number 139784 (Why is no real title available?)
- The relation of connected set cover and group Steiner tree
- Complexity of minimum corridor guarding problems
- Preprocessing Steiner problems from VLSI layout
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- scientific article; zbMATH DE number 2230214 (Why is no real title available?)
- General variable neighborhood search approach to group Steiner tree problem
- \(k\)-Transmitter watchman routes
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- Approximation algorithms for _p-shortest path and _p-group Steiner tree
- Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing
- From directed Steiner tree to directed polymatroid Steiner tree in planar graphs
- An approximation algorithm for generalized connectivity problem on planar graphs
- Approximating fault-tolerant group-Steiner problems
- On the minimum corridor connection problem and other generalized geometric problems
- Complexity of the minimum-length corridor problem
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694752)
