A catalog of Hanan grid problems

DOI10.1002/NET.1026MaRDI QIDQ2748382zbMATH OpenOpenAlexFDO

Authors Martin Zachariasen

Publication date 6 November 2002

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.1026

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Discrete location and assignment (90B80) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• On the rectilinear Steiner problem
• On the Exact Location of Steiner Points in General Dimension
• scientific article; zbMATH DE number 8006
• Fast heuristic algorithms for rectilinear Steiner trees
• Rectilinear group Steiner trees and applications in VLSI design

Cites work

• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• scientific article; zbMATH DE number 1286270 (Why is no real title available?)
• scientific article; zbMATH DE number 1424547 (Why is no real title available?)
• Minimum Diameter Spanning Trees and Related Problems
• On Steiner Minimal Trees with Rectilinear Distance
• On Steiner’s Problem with Rectilinear Distance
• On the Exact Location of Steiner Points in General Dimension
• Optimal and approximate bottleneck Steiner trees
• SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
• The rectilinear class Steiner tree problem for intervals on two parallel lines
• The rectilinear Steiner arborescence problem
• The weighted region problem

Cited in

(13)

• Rectilinear group Steiner trees and applications in VLSI design
• Delay-related secondary objectives for rectilinear Steiner minimum trees.
• Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
• A rounding algorithm for approximating minimum Manhattan networks
• Approximation schemes for capacitated geometric network design
• Approximation Algorithms for Buy-at-Bulk Geometric Network Design
• Approximation algorithms for buy-at-bulk geometric network design
• The hardness of the grid problemGi Under the Routine Resolution Method
• On the Exact Location of Steiner Points in General Dimension
• Approximation schemes for capacitated geometric network design
• On the rectilinear Steiner problem
• Minimum Manhattan network is NP-complete
• Grid recognition: classical and parameterized computational perspectives

This page was built for publication: A catalog of Hanan grid problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2748382)