Integral optimal primal point with a vertex-convex-combination representation for SFM
Statement
Given a submodular function on a finite ground set , find a submodular-function-minimization algorithm that produces an integral primal optimal point together with a representation of as a convex combination of vertices of the base polyhedron , where
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.