What polynomial-time computable upper bounds UB(G) for the minimum-bisection objective OPT(G) are valid for every graph and asymptotically tight on random graphs?
Statement
What polynomial-time computable upper bounds UB(G) for the minimum-bisection objective OPT(G) are valid for every graph and asymptotically tight on random graphs?
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.