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

DOI10.1007/S10958-016-2801-6zbMath1337.05092OpenAlexW2297628975MaRDI QIDQ289734

A. G. Bannikova, I. M. Nikonov, D. P. Il'yutko

Publication date: 31 May 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-016-2801-6

zbMATH Keywords

norming functionals

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Length, area and volume in real or complex geometry (51M25)

Related Items (1)

Minimal Networks: A Review

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locally minimal uniformly oriented shortest networks
• Locally minimal trees in \(n\)-normed spaces
• Planar Manhattan locally minimal and critical networks
• Minimum Steiner trees in normed planes
• Planar Manhattan local minimal and critical networks
• Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms
• Generalized Maxwell formula for the length of a minimal tree with a given topology
• Forbidden subpaths for Steiner minimum networks in uniform orientation metrics
• Branching extremals of the functional of $ \lambda$-normed length
• The local Steiner problem in normed planes
• Steiner Minimal Trees

This page was built for publication: The length of an extremal network in a normed space: Maxwell formula