NP-hardness conjecture for the bicolored MST crossing number
Statement
Let be a finite point set in the plane, and let denote its bicolored minimum spanning tree crossing number. The NP-hardness conjecture. Finding is NP-hard.
This concerns the computational complexity of the bicolored MST crossing number. The paper presents NP-hardness as a conjecture and gives no proof or resolution.
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.