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

DOI10.1007/S11590-015-0935-YzbMATH Open1353.90169OpenAlexW1766819550MaRDI QIDQ315511FDOQ315511

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

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

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)

Cites Work

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

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)