Constrained Optimum Communication Trees and Sensitivity Analysis

DOI10.1137/0213022MaRDI QIDQ3325495zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0213022

zbMATH Keywords

critical valuecut-treeminimum costoptimum communication treesensitivity analysisspanning trees

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• Optimum Communication Spanning Trees in Series-Parallel Networks
• Algorithms for the optimum communication spanning tree problem
• scientific article; zbMATH DE number 3891405
• Optimum requirement spanning trees and reliability of tree networks
• Approximation algorithms for some optimum communication spanning tree problems

Cited in

(6)

• Combined column-and-row-generation for the optimal communication spanning tree problem
• Algorithms for the optimum communication spanning tree problem
• An algorithm of the minimal cost spanning tree about communication network
• scientific article; zbMATH DE number 3896955 (Why is no real title available?)
• scientific article; zbMATH DE number 915979 (Why is no real title available?)
• Communication tree problems

This page was built for publication: Constrained Optimum Communication Trees and Sensitivity Analysis

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