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

DOI10.1007/S11590-015-0935-YMaRDI QIDQ315511zbMATH OpenOpenAlexFDO

Authors Jianping Li, Li Guan, Honglin Ding, Weidong Li

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

approximation algorithmsspanning treegraph 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)

Recommendations

• Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length
• Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces
• Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
• Approximation algorithms for constructing some required structures in digraphs
• scientific article; zbMATH DE number 3891405

Cites work

• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 563208 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• scientific article; zbMATH DE number 3285076 (Why is no real title available?)
• A note on two problems in connexion with graphs
• Approximations for Steiner trees with minimum number of Steiner points
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Optimum branchings
• Steiner tree problem with minimum number of Steiner points and bounded edge-length

Cited in

(5)

• Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces
• On approximations for constructing required subgraphs using stock pieces of fixed length
• 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
• Approximation algorithms for constructing some required structures in digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q315511)