Tobias Tscheuschner

Learn More
We study the complexity of local search in the max-cut problem with FLIP neighborhood, in which exactly one node changes the partition. We introduce a technique of constructing instances which enforce certain sequences of improving steps. Using our technique we can show that already graphs with maximum degree four satify the following two properties. 1.(More)
We consider the problem of finding a local optimum for Max-Cut with FLIP-neighborhood, in which exactly one node changes the partition. Schäffer and Yannakakis (SICOMP, 1991) showed PLS-completeness of this problem on graphs with unbounded degree. On the other side, Poljak (SICOMP, 1995) showed that in cubic graphs every FLIP local search takes O(n 2)(More)
For a long period of time, two person zero-sum games have been in the focus of researchers of various communities. The efforts were mainly driven by the fascination of special competitions like Deep Blue vs. Kasparov, and of the beauty of parlor games like Checkers, Backgammon, Othello and Go. Multi-player games, however, have been inspected by far less,(More)
  • 1