ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ([0,1]2,∥⋅∥2)([0,1]^2,\lVert\cdot\rVert_2) be the unit square with the Euclidean metric. For a linear order ≤\leq on [0,1]2[0,1]^2, let OR≤(n)OR_{\leq}(n) denote its TSP order ratio function.

Bertsimas–Grigni conjecture. For every linear order ≤\leq on the unit square,

OR≤(n)≳log⁡n.OR_{\leq}(n) \gtrsim \log n.

This conjecture asserts that every universal traveling-salesman ordering on the planar unit square has logarithmically growing worst-case competitive ratio. The paper establishes the lower bound OR≤(n)≳log⁡n/log⁡log⁡nOR_{\leq}(n) \gtrsim \sqrt{\log n/\log\log n} for every linear order, but does not resolve the conjectured logarithmic bound.

Record

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.