%0 Journal Article %1 journals/ipl/SpoerhaseW09 %A Spoerhase, Joachim %A Wirth, Hans-Christoph %D 2009 %J Inf. Process. Lett. %K %N 8 %P 391-394 %T An O(n(logn)2/loglogn) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees. %U http://dblp.uni-trier.de/db/journals/ipl/ipl109.html#SpoerhaseW09 %V 109

@article{journals/ipl/SpoerhaseW09, added-at = {2023-12-12T19:00:31.000+0100}, author = {Spoerhase, Joachim and Wirth, Hans-Christoph}, biburl = {https://www.bibsonomy.org/bibtex/2183859e7c6ba4a819ffa2394710100e6/admin}, ee = {https://doi.org/10.1016/j.ipl.2008.12.009}, interhash = {1a6aa283aca1e5afba2c4e90d63364b7}, intrahash = {183859e7c6ba4a819ffa2394710100e6}, journal = {Inf. Process. Lett.}, keywords = {}, number = 8, pages = {391-394}, timestamp = {2023-12-12T19:00:31.000+0100}, title = {An O(n(logn)2/loglogn) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees.}, url = {http://dblp.uni-trier.de/db/journals/ipl/ipl109.html#SpoerhaseW09}, volume = 109, year = 2009 }