Bipartite-coloring approximation conjecture for planar MAX-EMST-ratio
Statement
Let be a finite point set. A bipartite coloring is obtained by choosing a Euclidean minimum spanning tree of and partitioning so that every edge of the chosen tree has endpoints of different colors. Bipartite-coloring approximation conjecture. For every point set in , the EMST-ratio for any bipartite coloring is a -approximation for the maximum EMST-ratio.
The source presents triangular chains as examples whose approximation proportion approaches , and notes that proving this conjecture would yield an -time -approximation algorithm for the planar problem.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.