scientific article; zbMATH DE number 176576

MaRDI QIDQ4035749zbMATH OpenFDO

Authors Edmund Ihler, Gabriele Reich, Peter Widmayer

Publication date 18 May 1993

zbMATH Keywords

minimum spanning treenetwork optimizationNP-complete

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1003287
• Non-crossing of plane minimal spanning and minimal T1 networks
• Minimum Diameter Spanning Trees and Related Problems
• Low-Degree Spanning Trees of Small Weight
• scientific article; zbMATH DE number 1424545

Cited in

(13)

• Graham's problem on shortest networks for points on a circle
• Non-crossing of plane minimal spanning and minimal T1 networks
• Minimum spanning tree of line segments
• Existence of shortest directed networks in \(\mathbb{R}^ 2\)
• Minimum diameter vertex-weighted Steiner tree
• Shortest directed networks in the plane
• On the existence of shortest networks in Banach spaces
• scientific article; zbMATH DE number 1382484 (Why is no real title available?)
• Algorithms for the minimum diameter terminal Steiner tree problem
• A uniform self-stabilizing minimum diameter spanning tree algorithm
• On the minimum diameter spanning tree problem
• Parameterized approximations for the minimum diameter vertex-weighted Steiner tree problem in graphs with parameterized weights
• Combinatorial network abstraction by trees and distances

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 Q4035749)