scientific article; zbMATH DE number 219265

MaRDI QIDQ4694752zbMATH OpenFDO

Authors Gabriele Reich, Peter Widmayer

Publication date 29 June 1993

zbMATH Keywords

VLSI designSteiner's problemefficient approximation algorithms

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Class Steiner trees and VLSI-design
• scientific article; zbMATH DE number 139784
• Rectilinear group Steiner trees and applications in VLSI design
• scientific article; zbMATH DE number 222076
• A faster approximation algorithm for the Steiner problem in graphs

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
• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
• scientific article; zbMATH DE number 139784 (Why is no real title available?)
• Related axis: the extension to XPath towards effective XML search
• The relation of connected set cover and group Steiner tree
• Approximation algorithms for group prize-collecting and location-routing problems
• Watchman routes for lines and line segments
• Complexity of minimum corridor guarding problems
• Some formulations for the group Steiner tree problem
• On graphs preserving rectilinear shortest paths in the presence of obstacles
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
• On the minimum corridor connection problem and other generalized geometric problems
• scientific article; zbMATH DE number 2230214 (Why is no real title available?)
• 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
• An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
• Preprocessing Steiner problems from VLSI layout
• \(k\)-Transmitter watchman routes
• Approximating \(k\)-generalized connectivity via collapsing HSTs
• The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
• Generalized network design problems.
• Approximating fault-tolerant group-Steiner problems
• How to sort by walking and swapping on paths and trees
• A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction
• Shortest paths and Steiner trees in VLSI routing

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)