Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Traveling salesmen in the presence of competition

S. Fekete, R. Fleischer, A. Fraenkel, and M. Schmitt. Theoretical Computer Science, 313 (3): 377 - 392 (2004)Algorithmic Combinatorial Game Theory.
DOI: http://dx.doi.org/10.1016/j.tcs.2002.12.001

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

S. Schumann

S. Seemann

S. Wartzack

Boettinger S

S. Toro

Other publications of authors with the same name

Complexity of Solving Algebraic Equations.A. Fraenkel, and Y. Yesha. Inf. Process. Lett., 10 (4/5): 178-179 (1980)Paired Sequential Lists in a memory Interval.A. Fraenkel. Inf. Process. Lett., 8 (1): 9-10 (1979)The Use and Usefulness of Numeration SystemsA. Fraenkel. Inf. Comput., 81 (1): 46-61 (April 1989)An extension of the periodicity lemma to longer periods.A. Fraenkel, and J. Simpson. Discrete Applied Mathematics, 146 (2): 146-155 (2005)Bidirectional Huffman Coding.A. Fraenkel, and S. Klein. Comput. J., 33 (4): 296-307 (1990)How Many Squares Can a String Contain?A. Fraenkel, and J. Simpson. J. Comb. Theory, Ser. A, 82 (1): 112-120 (1998)Generalized Wythoff arrays, shuffles and interspersions.A. Fraenkel, and C. Kimberling. Discrete Mathematics, 126 (1-3): 137-149 (1994)Beatty sequences and Langford sequences.R. Eggleton, A. Fraenkel, and R. Simpson. Discrete Mathematics, 111 (1-3): 165-178 (1993)Complexity, appeal and challenges of combinatorial games.A. Fraenkel. Theor. Comput. Sci., 313 (3): 393-415 (2004)Traveling Salesmen in the Presence of CompetitionS. Fekete, R. Fleischer, A. Fraenkel, and M. Schmitt. CoRR, (2002)