A risk-reward competitive analysis for the recoverable Canadian traveller problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5165 LNCS, Issue , 2008, Pages 417-426

  Su, Bing ^a,b   Xu, Yinfeng ^a,c   Xiao, Peng ^a,c   Tian, Lei ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b XI'AN TECHNOLOGICAL UNIVERSITY   (China)

^c XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Comparison strategy; Competitive analysis; Recoverable CTP; Risk reward model

Indexed keywords

BEVERAGES; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RISK ANALYSIS; RISK ASSESSMENT; WIRELESS SENSOR NETWORKS;

ADAPTIVE STRATEGIES; COMPARISON STRATEGY; COMPETITIVE ANALYSIS; COMPETITIVE RATIOS; DESTINATION NODES; INTERNATIONAL CONFERENCES; ONLINE STRATEGY; RECOVERABLE-CTP; RECOVERY TIME; RISK-REWARD COMPETITIVE ANALYSIS; RISK-REWARD MODEL; SHORTEST PATH; TRAVEL-TIME;

COMPUTER SYSTEM RECOVERY;

EID: 51849094959     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85097-7_39     Document Type: Conference Paper

References (11)

1. Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science 84(1), 127-150 (1991)
2. Bar-Noy, A., Schieber, B.: The Canadian traveller problem. In: Proceedings of the second annual ACM-SIAM Symposium on Discrete Algorithms, pp. 261-270 (1991)
3. David, S.B., Borodin, A.: A new measure for the study of the on-line algorithm. Algorithmica 11, 73-91 (1994)
4. Westphal, S.: A note on the k-Canadian traveller problem. Information Processing Letters 106(3), 87-89 (2008)
5. Xu, Y.F., Hu, M.L., Su, B., Zhu, B.H., Zhu, Z.J.: The Canadian Traveller Problem and Its Competitive Analysis. Journal of Combinatorial Optimization, 4 (in press, 2008)
6. Su, B., Xu, Y.F.: Online recoverable Canadian traveller problem. In: Proceedings of the International Conference on Management Science and Engineering, pp. 633-639 (2004)
7. Sleator, D., Tarjan, R.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202-208 (1985)
8. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)
9. Fiat, A., Rabani, Y., Ravid, Y.: Competitive k-server algorithms. In: Proceedings of the 22nd IEEE Symposium on Foundation of Computer Science, pp. 454-463 (1990)
10. Fiat, A., Woeginger, G.J.: Online algorithms: The state of art. Springer, Heidelberg (1998)
11. Al-Binali, S.: A risk-reward framework for the competitive analysis of financial games. Algorithmica 25, 99-115 (1999)