Traveling salesmen in the presence of competition-Reference-Cited by-同舟云学术

Traveling salesmen in the presence of competition

Published:2004-02 Issue:3 Volume:313 Page:377-392
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Fekete Sándor P.,Fleischer Rudolf,Fraenkel Aviezri,Schmitt Matthias

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference8 articles.

1. E.M. Arkin, M. Bender, S.P. Fekete, J.S.B. Mitchell, M. Skutella, The freeze-tag problem: how to wake up a swarm of robots, Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, 2002, pp. 568–577.

2. Winning Ways for Your Mathematical Plays;Berlekamp,1982

3. PSPACE-hardness of some combinatorial games;Fraenkel;J. Combin. Theory Ser. A,1987

4. Complexity of problems in games, graphs and algebraic equations;Fraenkel;Discrete Appl. Math.,1979

5. The complexity of pursuit on a graph;Goldstein;Theoret. Comput. Sci. (Math Games),1995

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game;Annals of Operations Research;2022-12-05

2. An Improved Ant Colony Approach for the Competitive Traveling Salesmen Problem;2022 IEEE Congress on Evolutionary Computation (CEC);2022-07-18

3. Co-Evolving Rationalizable Strategies for Combinatorial Multi-Objective Games;SSRN Electronic Journal;2022

4. A new competitive travelling salesmen problem based on metaheuristics;THE 2ND UNIVERSITAS LAMPUNG INTERNATIONAL CONFERENCE ON SCIENCE, TECHNOLOGY, AND ENVIRONMENT (ULICoSTE) 2021;2022

5. Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game;WALCOM: Algorithms and Computation;2021