论文信息 - Milling a Graph with Turn Costs: A Parameterized Complexity Perspective

Milling a Graph with Turn Costs: A Parameterized Complexity Perspective

The DISCRETTE MILLING problem is a natural and quite general graph-theoretic model for geometric milling problems: Given a graph, one asks for a walk that covers all its vertices with a minimum number of turns, as specified in the graph model by a 0/1 turncost function fx at each vertex x giving, for each ordered pair of edges (e, f) incident at x, the turn cost at x of a walk that enters the vertex on edge e and departs on edge f. We describe an initial study of the parameterized complexity of the problem.

[1] Michael R. Fellows,et al. Parameterized Complexity , 1998 .

[2] Fedor V. Fomin,et al. Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions , 2010, Algorithmica.

[3] Martin Held,et al. On the Computational Geometry of Pocket Machining , 1991, Lecture Notes in Computer Science.

[4] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .

[5] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[6] Esther M. Arkin,et al. Optimal covering tours with turn costs , 2001, SODA '01.

[7] Fedor V. Fomin,et al. Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions , 2005, ESA.

[8] Stefano Leonardi,et al. Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.

[9] Michael R. Fellows,et al. On the Complexity of Some Colorful Problems Parameterized by Treewidth , 2007, COCOA.

[10] Matt Brown,et al. Invited talk , 2007 .

[11] Stefan Szeider,et al. Not So Easy Problems for Tree Decomposable Graphs , 2011, ArXiv.

[12] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.