On the computational geometry of pocket machining
On the computational geometry of pocket machining
Optimal Covering Tours with Turn Costs
SIAM Journal on Computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
On the complexity of some colorful problems parameterized by treewidth
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
| Hi-index | 0.00 |
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.