AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM

DOI10.1142/S0219265907001916zbMath1226.05088OpenAlexW1985309093MaRDI QIDQ3636563

Nicolas Thibault, Christian Laforest

Publication date: 30 June 2009

Published in: Journal of Interconnection Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219265907001916

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Linear bounds for on-line Steiner problems
• Online algorithms. The state of the art
• Approximation algorithms for the shortest total path length spanning tree problem
• Extending greedy multicast routing to delay sensitive applications
• Dynamic Steiner Tree Problem

This page was built for publication: AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM