ProbXiv
Explorersign in
Problem archiveProblem record

Statement

What is the complexity of finding a shortest tour in a solid planar grid graph? A planar grid graph is a graph whose vertices are any set of points on the planar integer lattice and whose edges connect every pair of vertices at unit distance. Distances between nodes correspond to induced shortest-path distances in the graph, which corresponds to ``Manhattan'' distances. A grid graph is solid if it does not have any holes, i.e., its complement in the planar integer lattice is connected.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.