Improving spanning trees by upgrading nodes

DOI10.1007/3-540-63165-8_185zbMath1401.90248OpenAlexW2138978439MaRDI QIDQ4571960

R. Ravi, S. S. Ravi, Ravi Sundaram, Hartmut Noltemeier, Hans-Christoph Wirth, Sven O. Krumke, Madhav V. Marathe

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

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

Related Items (2)

Upgrading min-max spanning tree problem under various cost functions ⋮ Minimizing broadcast costs under edge reductions in tree networks

Cites Work

• Unnamed Item
• Unnamed Item
• Improving the location of minisum facilities through network modification
• The complexity of designing a network with minimum diameter
• Bicriteria Network Design Problems
• Network upgrading problems
• The network inhibition problem

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