Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige. An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. In Jean-Jacques Lévy, Ernst W. Mayr, John C. Mitchell, editors, Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France. pages 251-264, Kluwer, 2004.
@inproceedings{MamadaUMF04, title = {An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks}, author = {Satoko Mamada and Takeaki Uno and Kazuhisa Makino and Satoru Fujishige}, year = {2004}, researchr = {https://researchr.org/publication/MamadaUMF04}, cites = {0}, citedby = {0}, pages = {251-264}, booktitle = {Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France}, editor = {Jean-Jacques Lévy and Ernst W. Mayr and John C. Mitchell}, publisher = {Kluwer}, isbn = {1-4020-8140-5}, }