Pages that link to "Item:Q2583717"

The following pages link to The traveling salesman problem with few inner points (Q2583717):

Displaying 14 items.

• A fixed parameter algorithm for optimal convex partitions (Q1002101) (← links)
• The convex-hull-and-line traveling salesman problem: A solvable case (Q1332749) (← links)
• The two-convex-polygons TSP: A solvable case (Q1367695) (← links)
• Parameterized complexity of theory of mind reasoning in dynamic epistemic logic (Q1711514) (← links)
• Euclidean TSP on two polygons (Q2268868) (← links)
• On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
• The minimum weight triangulation problem with few inner points (Q2495946) (← links)
• A polynomial algorithm for a constrained traveling salesman problem (Q2748381) (← links)
• Computing and Combinatorics (Q4681186) (← links)
• The Traveling Salesman Problem with Distances One and Two (Q4697080) (← links)
• Traversing a set of points with a minimum number of turns (Q5901403) (← links)
• Traversing a set of points with a minimum number of turns (Q5901749) (← links)
• Euclidean TSP in narrow strips (Q6541986) (← links)
• Non-crossing Hamiltonian paths and cycles in output-polynomial time (Q6614115) (← links)