ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P⊆R2P\subseteq\mathbb{R}^2 be a finite point set. A bipartite coloring is obtained by choosing a Euclidean minimum spanning tree of PP and partitioning P=R∪BP=R\cup B so that every edge of the chosen tree has endpoints of different colors. Bipartite-coloring approximation conjecture. For every point set in R2\mathbb{R}^2, the EMST-ratio for any bipartite coloring is a (1.5)(1.5)-approximation for the maximum EMST-ratio.

The source presents triangular chains as examples whose approximation proportion approaches 1.51.5, and notes that proving this conjecture would yield an O(nlog⁡n)O(n\log n)-time (1.5)(1.5)-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 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.