Improving spanning trees by upgrading nodes

DOI10.1007/3-540-63165-8_185MaRDI QIDQ4571960zbMATH OpenOpenAlexFDO

Authors R. Ravi, S. S. Ravi, Ravi Sundaram, Sven O. Krumke, Madhav V. Marathe, Hartmut Noltemeier, H.-C. Wirth

Publication date 4 July 2018

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://digital.library.unt.edu/ark:/67531/metadc680950/

Mathematics Subject Classification ID

Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Improving spanning trees by upgrading nodes
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• Upgrading nodes in tree-shaped hub location
• Improving multicut in directed trees by upgrading nodes
• Lowering eccentricity of a tree by node upgrading
• Achieve faster spanning tree convergence
• Efficient spanning trees
• Increasing the Weight of Minimum Spanning Trees
• scientific article; zbMATH DE number 871953
• Performance Oriented Spanning Trees

Cites work

• scientific article; zbMATH DE number 1256748 (Why is no real title available?)
• scientific article; zbMATH DE number 871953 (Why is no real title available?)
• Improving the location of minisum facilities through network modification
• Network upgrading problems
• The complexity of designing a network with minimum diameter
• The network inhibition problem

Cited in

(17)

• Up- and downgrading the 1-center in a network
• Approximation algorithms for certain network improvement problems
• Minimizing broadcast costs under edge reductions in tree networks
• Upgrading nodes in tree-shaped hub location
• Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
• Upgrading min-max spanning tree problem under various cost functions
• Improving spanning trees by upgrading nodes
• Improving multicut in directed trees by upgrading nodes
• Optimal upgrading schemes for effective shortest paths in networks
• Best upgrade plans for large road networks
• scientific article; zbMATH DE number 1262800 (Why is no real title available?)
• scientific article; zbMATH DE number 1163718 (Why is no real title available?)
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• Lowering eccentricity of a tree by node upgrading
• Upgrading bottleneck constrained forests
• The constrained Bottleneck spanning tree problem with upgrades
• Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies

This page was built for publication: Improving spanning trees by upgrading nodes

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