Minimum dilation tree approximation problem
Statement
Given a finite point set with , let range over spanning trees on , with each edge weighted by its Euclidean length. Define the dilation of by , where is the shortest-path distance in , and let . Does there exist a constant and a polynomial-time algorithm that, for every such , outputs a spanning tree satisfying ?
Record
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.