TY - GEN
T1 - Bumblebee visitation problem
AU - Das, Sandip
AU - Gahlawat, Harmender
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2019.
PY - 2019/1/1
Y1 - 2019/1/1
N2 - Bumblebee visitation problem is defined on connected graphs where a mobile agent, called Bumblebee, moves along the edges under some rules to achieve some optimization function. We prove this problem to be NP-hard for general graphs. We present a linear time algorithm for this problem on trees.
AB - Bumblebee visitation problem is defined on connected graphs where a mobile agent, called Bumblebee, moves along the edges under some rules to achieve some optimization function. We prove this problem to be NP-hard for general graphs. We present a linear time algorithm for this problem on trees.
UR - https://www.scopus.com/pages/publications/85063515975
U2 - 10.1007/978-3-030-11509-8_21
DO - 10.1007/978-3-030-11509-8_21
M3 - Conference contribution
AN - SCOPUS:85063515975
SN - 9783030115081
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 254
EP - 262
BT - Algorithms and Discrete Applied Mathematics - 5th International Conference, CALDAM 2019, Proceedings
A2 - Pal, Sudebkumar Prasant
A2 - Vijayakumar, Ambat
PB - Springer Verlag
T2 - 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2019
Y2 - 14 February 2019 through 16 February 2019
ER -