Planar Manhattan local minimal and critical networks

DOI10.1006/eujc.2001.0561zbMath1012.05056OpenAlexW1998496518MaRDI QIDQ1864609

Alexandr O. Ivanov, A. A. Tuzhilin, Le Hong Van

Publication date: 18 March 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2001.0561

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

The length of an extremal network in a normed space: Maxwell formula

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steiner minimal trees for regular polygons
• A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets
• The Steiner tree problem
• Steiner minimal trees
• Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms
• On the Problem of Steiner
• The symplectic topology of completely integrable Hamiltonian systems
• On Steiner Minimal Trees with Rectilinear Distance
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• The twist number of planar linear trees
• The classification of minimal skeletons with a regular boundary
• Branching geodesics in normed spaces
• SOME PROBLEMS CONCERNING MINIMAL NETWORKS
• On Steiner’s Problem with Rectilinear Distance

This page was built for publication: Planar Manhattan local minimal and critical networks