A linear time algorithm for balance vertices on trees

DOI10.1016/j.disopt.2018.11.001zbMath1506.90262OpenAlexW2904083610WikidataQ128765063 ScholiaQ128765063MaRDI QIDQ2419583

van Huy Pham, Kien Trung Nguyen, Tran Thu Le

Publication date: 14 June 2019

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2018.11.001

zbMATH Keywords

treecomplexitybalance vertices

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10)

Related Items (2)

The reverse selective balance center location problem on trees ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients

Cites Work

• Extensive facility location problems on networks: an updated review
• A note on balance vertices in trees
• Balance in trees
• Location Theory
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Balance vertices in trees

This page was built for publication: A linear time algorithm for balance vertices on trees