@inproceedings{72b2e97048ed4f8f9174e6f336618cd0,
title = "The k-Canadian travelers problem with communication",
abstract = "From the online point of view, this paper studies a variation of the k-Canadian Traveler Problem (k-CTP), in which there are multiple travelers who communicate with each other to share real-time information. The objective is to find a route from the origination to the destination as soon as possible. Based on different communication levels, we consider two problems with full communication(P1) and with limited communication(P2) respectively. We present lower bounds for the two problems respectively. Considering the urban traffic environment, we propose a Retrace-Alternating strategy for both problems, and prove that increasing the proportion of full communication travelers may not always improve the competitive performance of online strategies.",
keywords = "communication, competitive analysis, multiple travelers, online k-CTP",
author = "Huili Zhang and Yinfeng Xu",
year = "2011",
doi = "10.1007/978-3-642-21204-8\_6",
language = "英语",
isbn = "9783642212031",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "17--28",
booktitle = "Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2011, Proceedings",
note = "5th International Frontiers in Algorithmics Workshop and the 7th International Conference on Algorithmic Aspects in Information and Management, FAW-AAIM 2011 ; Conference date: 28-05-2011 Through 31-05-2011",
}