A catalog of Hanan grid problems

DOI10.1002/net.1026zbMath0996.90063OpenAlexW2158686436MaRDI QIDQ2748382

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

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

Related Items (9)

Approximation Algorithms for Buy-at-Bulk Geometric Network Design ⋮ APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN ⋮ Grid recognition: classical and parameterized computational perspectives ⋮ Delay-related secondary objectives for rectilinear Steiner minimum trees. ⋮ Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees ⋮ Approximation Schemes for Capacitated Geometric Network Design ⋮ A rounding algorithm for approximating minimum Manhattan networks ⋮ Minimum Manhattan network is NP-complete ⋮ Approximation Schemes for Capacitated Geometric Network Design

Cites Work

• The rectilinear Steiner arborescence problem
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• The rectilinear class Steiner tree problem for intervals on two parallel lines
• Optimal and approximate bottleneck Steiner trees
• Minimum Diameter Spanning Trees and Related Problems
• SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
• On the Exact Location of Steiner Points in General Dimension
• On Steiner Minimal Trees with Rectilinear Distance
• The weighted region problem
• On Steiner’s Problem with Rectilinear Distance
• Unnamed Item
• Unnamed Item

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