Approximations for constructing tree-form structures using specific material with fixed length

DOI10.1007/s11590-015-0935-yzbMath1353.90169OpenAlexW1766819550MaRDI QIDQ315511

Weidong Li, Jianping Li, Li Guan, Honglin Ding

Publication date: 21 September 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0935-y

zbMATH Keywords

spanning treeapproximation algorithmsgraph structuresmetric Steiner treesingle-source shortest paths tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length ⋮ Approximation algorithms for constructing required subgraphs using stock pieces of fixed length

Cites Work

• A note on two problems in connexion with graphs
• Steiner tree problem with minimum number of Steiner points and bounded edge-length
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Optimum branchings
• Approximations for Steiner trees with minimum number of Steiner points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximations for constructing tree-form structures using specific material with fixed length