Efficient algorithms for finding 2‐medians of a tree. Issue 3 (21st September 2020)

• Record Type: Journal Article
• Authors: Oudjit, Aissa; Stallmann, Matthias F.
• Is Part Of: Networks. Volume 77:Issue 3(2021)
• Page Start: 383
• Page End: 402
• Publication Date: 2020-09-21
• Subjects: 2‐median -- binary search -- linear time -- priority queue -- sorting -- trees; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21978
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract: The p ‐median problem for networks is NP‐hard, but polynomial time algorithms exist for trees ( n is the number of nodes): O( pn 2 ) by Tamir, and O( n lg p + 2 n ) by Benkoczi and Bhattacharya. Goldman gave an O( n ) algorithm for the 1‐median problem on trees. Mirchandani and Oudjit proved localization properties for 2‐medians on trees; these were later used to obtain an O( n lg n ) bound, and, in special cases, O( n ) . We present a framework that unifies all efficient algorithms for the 2‐median problem on trees. Our framework isolates the nonlinear part of the computation so that future time‐bound improvements are easily incorporated. We also introduce a method for reducing the search space, improving all known runtimes in many instances. Finally, we give a new algorithm for the case where edge lengths are positive integers. The associated time bound is O( n + D ) , where D is the sum of the logarithms of edge lengths. This is O( n ) if edge lengths are bounded by a constant and O( n lglg n ) if they are O(lg n ) . The algorithm is flexible enough to extend to noninteger edge lengths, preserving the time bound in some circumstances.