2 papers
cs.CC2002
Traveling Salesmen in the Presence of Competition
Sandor P. Fekete, Rudolf Fleischer, Aviezri Fraenkel +1
We propose the ``Competing Salesmen Problem'' (CSP), a 2-player competitive version of the classical Traveling Salesman Problem. This problem arises when considering two competing…
cs.CC2001
The Complexity of Clickomania
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine +3
We study a popular puzzle game known variously as Clickomania and Same Game. Basically, a rectangular grid of blocks is initially colored with some number of colors, and the player…