Open Problem: Iterative rounding for feedback vertex set Samuel Fiorini The (undirected) feedback vertex set problem is to find, given a vertex-weighted graph (G, c) a minimum…
Statement
Open Problem: Iterative rounding for feedback vertex set Samuel Fiorini The (undirected) feedback vertex set problem is to find, given a vertex-weighted graph (G, c) a minimum cost set X such that G − X is a forest. Is it true that for every extreme solution x∗ to the LP, there is a vertex v with ∗ x (v) \geq 1/2? Open Problem: Maximizing Subdeterminants in Nonsymmetric Matrices Nima Anari
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.