Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Rao, B.V. Raghavendra"'
Publikováno v:
In Discrete Applied Mathematics 30 April 2020 277:127-138
Publikováno v:
In Theoretical Computer Science 6 March 2014 524:90-102
Publikováno v:
In Journal of Computer and System Sciences May 2012 78(3):698-706
Publikováno v:
Information and Computation. 285:104921
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef00990f7ea32ff3b36be731ff5cbc35
https://doi.org/10.1016/j.ic.2022.104921
https://doi.org/10.1016/j.ic.2022.104921
Autor:
Ghosal, Purnata, Rao, B.V. Raghavendra
Publikováno v:
In Information Processing Letters November 2019 151
Autor:
Bringmann, Karl, Engels, Christian, Manthey, Bodo, Rao, B.V. Raghavendra, Chatterjee, K., Sgall, J.
Publikováno v:
Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), 219-230
STARTPAGE=219;ENDPAGE=230;TITLE=Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013)
Mathematical Foundations of Computer Science 2013 ISBN: 9783642403125
MFCS
STARTPAGE=219;ENDPAGE=230;TITLE=Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013)
Mathematical Foundations of Computer Science 2013 ISBN: 9783642403125
MFCS
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of random metric i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb87d8f38f93dea82c597ea90cda3031
https://research.utwente.nl/en/publications/5ba14c17-ba7e-49bf-93ce-4d1e46d135a4
https://research.utwente.nl/en/publications/5ba14c17-ba7e-49bf-93ce-4d1e46d135a4
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642222993
WADS
12th International Symposium on Algorithms and Data Structures, WADS 2011, 110-121
STARTPAGE=110;ENDPAGE=121;TITLE=12th International Symposium on Algorithms and Data Structures, WADS 2011
WADS
12th International Symposium on Algorithms and Data Structures, WADS 2011, 110-121
STARTPAGE=110;ENDPAGE=121;TITLE=12th International Symposium on Algorithms and Data Structures, WADS 2011
Euclidean optimization problems such as TSP and minimum-length matching admit fast partitioning algorithms that compute near-optimal solutions on typical instances. We develop a general framework for the application of smoothed analysis to partitioni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5485a1e5fd713c0d3f05093a1e261d37
https://doi.org/10.1007/978-3-642-22300-6_10
https://doi.org/10.1007/978-3-642-22300-6_10
Autor:
Jansen, Maurice, Rao B.V., Raghavendra
Publikováno v:
Computer Science - Theory & Applications (9783642033506); 2009, p179-190, 12p
Publikováno v:
Computer Science - Theory & Applications (9783642033506); 2009, p286-298, 13p
Autor:
Yixin Cao, Jianer Chen
This book constitutes the refereed proceedings of the 23rd International Conference on Computing and Combinatorics, COCOON 2017, held in Hiong Kong, China, in August 2017. The 56 full papers papers presented in this book were carefully reviewed and s