Go to the corresponding LIPIcs Volume Portal 
Dereniowski, Dariusz ; Kosowski, Adrian ; Uznanski, Przemyslaw ; Zou, Mengchuan
pdfformat: 

@InProceedings{dereniowski_et_al:LIPIcs:2017:7450, author = {Dariusz Dereniowski and Adrian Kosowski and Przemyslaw Uznanski and Mengchuan Zou}, title = {{Approximation Strategies for Generalized Binary Search in Weighted Trees}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {84:184:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770415}, ISSN = {18688969}, year = {2017}, volume = {80}, editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7450}, URN = {urn:nbn:de:0030drops74507}, doi = {10.4230/LIPIcs.ICALP.2017.84}, annote = {Keywords: Approximation Algorithm, Adaptive Algorithm, Graph Search, Binary Search, Vertex Ranking, Trees} }
Keywords:  Approximation Algorithm, Adaptive Algorithm, Graph Search, Binary Search, Vertex Ranking, Trees  
Seminar:  44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)  
Issue Date:  2017  
Date of publication:  06.07.2017 