Open problem: Approximating submodular functions by matroid rank functions László Végh Let f : 2V \to R+ be a nonnegative and monotone increasing submodular function with f…
Statement
Open problem: Approximating submodular functions by matroid rank functions László Végh Let f : 2V \to R+ be a nonnegative and monotone increasing submodular function with f (\varnothing) = 0. The question is whether a non-integer function f can still be well-approximated by a matroid rank? That is, does there exists a constant \alpha > 0 such that for any function f as above, there exists a matroid rank function f : 2V \to Z+ such that r(S) \leq f (S) \leq \alphar(S) \forallS \subseteq V ? \alpha Open problem: Signings in the subtour polytope Michel Goemans Consider the subtour polytope P of the TSP on G = (V, E) (where we have dropped the degree constraints, without loss of generality, for the question below): P = {x \in RE : x(\delta(S)) \geq 2 for all S \subseteq V, x \geq 0}. But is the following true: Open question 1. For any x \in P and for any T \subseteq VPof even cardinality, does there exist a signing s : T \to {−1, +1} (with s(T ) := v\inT s(v) = 0) such that there exists a transshipment (flow) f in G with capacities {ue : e \in E} and whose excess at vertex v is s(v) for v \in T and 0 otherwise. Let f : 2V \to R+ be a nonnegative and monotone increasing submodular function with f (\varnothing) = 0. Further, assume that for each i \in V , f ({i}) = 1. If we further assume that f is integer-valued, then f is a matroid rank function. The question is whether a non-integer function f can still be well-approximated by a matroid rank? That is, does there exists a constant \alpha > 0 such that for any function f as above, there exists a matroid rank function f : 2V \to Z+ such that r(S) \leq f (S) \leq \alphar(S) \forallS \subseteq V ? \alpha
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.