scientific article; zbMATH DE number 219265
From MaRDI portal
Publication:4694752
zbMATH Open0768.68176MaRDI QIDQ4694752FDOQ4694752
Authors: Gabriele Reich, Peter Widmayer 
Publication date: 29 June 1993
Title of this publication is not available (Why is that?)
Recommendations
Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (30)
- Solving group Steiner problems as Steiner problems.
- Rectilinear group Steiner trees and applications in VLSI design
- General variable neighborhood search approach to group Steiner tree problem
- Blocking for external graph searching
- Computing directed Steiner path covers
- Title not available (Why is that?)
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
- Related axis: the extension to XPath towards effective XML search
- The relation of connected set cover and group Steiner tree
- Watchman routes for lines and line segments
- Approximation algorithms for group prize-collecting and location-routing problems
- Some formulations for the group Steiner tree problem
- Complexity of minimum corridor guarding problems
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- On graphs preserving rectilinear shortest paths in the presence of obstacles
- Title not available (Why is that?)
- 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
- A greedy approximation algorithm for the group Steiner problem
- Preprocessing Steiner problems from VLSI layout
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
- \(k\)-Transmitter watchman routes
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- Generalized network design problems.
- How to sort by walking and swapping on paths and trees
- Approximating fault-tolerant group-Steiner problems
- Shortest paths and Steiner trees in VLSI routing
- A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction
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)
