Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 123-134
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the Complexity of Some Colorful Problems Parameterized by TreewidthLecture Notes in Computer Science, 2007
- Invitation to Fixed-Parameter Algorithms2006
- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch DecompositionsLecture Notes in Computer Science, 2005
- Optimal Covering Tours with Turn CostsSIAM Journal on Computing, 2005
- Parameterized Complexity1999
- On the Computational Geometry of Pocket Machining1991