%0 Conference Paper %1 conf/cocoon/BhattacharyaK12 %A Bhattacharya, Binay K. %A Kameda, Tsunehiko %B COCOON %D 2012 %E Gudmundsson, Joachim %E Mestre, Julián %E Viglas, Taso %I Springer %K dblp %P 1-12 %T A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. %U http://dblp.uni-trier.de/db/conf/cocoon/cocoon2012.html#BhattacharyaK12 %V 7434 %@ 978-3-642-32240-2

@inproceedings{conf/cocoon/BhattacharyaK12, added-at = {2017-05-23T00:00:00.000+0200}, author = {Bhattacharya, Binay K. and Kameda, Tsunehiko}, biburl = {https://www.bibsonomy.org/bibtex/22999c5e91b83bd86eb1be5ce69871f4b/dblp}, booktitle = {COCOON}, crossref = {conf/cocoon/2012}, editor = {Gudmundsson, Joachim and Mestre, Julián and Viglas, Taso}, ee = {https://doi.org/10.1007/978-3-642-32241-9_1}, interhash = {c9d8e00684e4e0f9d618eead8d891155}, intrahash = {2999c5e91b83bd86eb1be5ce69871f4b}, isbn = {978-3-642-32240-2}, keywords = {dblp}, pages = {1-12}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:37:50.000+0200}, title = {A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree.}, url = {http://dblp.uni-trier.de/db/conf/cocoon/cocoon2012.html#BhattacharyaK12}, volume = 7434, year = 2012 }