Balanced Partition of Minimum Spanning Trees

DOI10.1007/3-540-47789-6_3MaRDI QIDQ4739324zbMATH OpenOpenAlexFDO

Authors Mattias Andersson, Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-47789-6_3

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• BALANCED PARTITION OF MINIMUM SPANNING TREES
• Approximation Algorithms for Min–Max Tree Partition
• Approximation algorithms for minimum tree partition
• scientific article; zbMATH DE number 949659
• Balanced partitions of trees and applications

Cited in

(4)

• Partitioning a graph into balanced connected classes: formulations, separation and experiments
• Balanced partitions of trees and applications
• BALANCED PARTITION OF MINIMUM SPANNING TREES
• On partitioning minimum spanning trees

This page was built for publication: Balanced Partition of Minimum Spanning Trees

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