Milling a graph with turn costs: A parameterized complexity perspective

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6410 LNCS, Issue , 2010, Pages 123-134

  Fellows, Mike ^a   Giannopoulos, Panos ^b   Knauer, Christian ^c   Paul, Christophe ^d   Rosamond, Frances ^a   Whitesides, Sue ^e   Yu, Nathan ^f  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c UNIVERSITY OF BAYREUTH   (Germany)

^d LIRMM   (France)

^e UNIVERSITY OF VICTORIA   (Canada)

^f NONE

Author keywords

[No Author keywords available]

Indexed keywords

GENERAL GRAPH; GRAPH MODEL; PARAMETERIZED COMPLEXITY;

COMPUTER SCIENCE; GRAPH THEORY;

MILLING (MACHINING);

EID: 78650180461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16926-7_13     Document Type: Conference Paper

References (8)

1. 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) (Pubitemid 43952261)
2. 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)
3. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
4. 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)
5. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
6. Held, M.: On the Computational Geometry of Pocket Machining. LNCS, vol. 500. Springer, Heidelberg (1991)
7. Niedermeier, R.: Invitation to Fixed Parameter Algorithms, vol. 31. Oxford University Press, Oxford (2006)
8. Szeider, S.: Not so easy problems for tree decomposable graphs. In: International Conference on Discrete Mathematics (ICDM), pp. 161-171 (2008) (invited talk)