Abstract
The Discrete 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 f x 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.
Research initiated at the 6th McGill - INRIA Barbados Workshop on Computational Geometry in Computer Graphics, 2007.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arkin, E., Bender, M., Demaine, E., Fekete, S., Mitchell, J., Sethia, S.: Optimal covering tours with turn costs. SIAM J. Computing 35(3), 531–566 (2005)
Dorn, F., Penninkx, E., Bodlaender, H., Fomin, F.: Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 95–106. Springer, Heidelberg (2005)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Fellows, M., Fomin, F., Lokshtanov, D., Rosamond, F., Saurabh, S., Szeider, S., Thomassen, C.: On the complexity of some colorful problems parameterized by treewidth. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol. 4616, pp. 366–377. Springer, Heidelberg (2007)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
Held, M.: On the Computational Geometry of Pocket Machining. LNCS, vol. 500. Springer, Heidelberg (1991)
Niedermeier, R.: Invitation to Fixed Parameter Algorithms, vol. 31. Oxford University Press, Oxford (2006)
Szeider, S.: Not so easy problems for tree decomposable graphs. In: International Conference on Discrete Mathematics (ICDM), pp. 161–171 (2008) (invited talk)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fellows, M. et al. (2010). Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. In: Thilikos, D.M. (eds) Graph Theoretic Concepts in Computer Science. WG 2010. Lecture Notes in Computer Science, vol 6410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16926-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-16926-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16925-0
Online ISBN: 978-3-642-16926-7
eBook Packages: Computer ScienceComputer Science (R0)