The unimodular intersection problem
نویسندگان
چکیده
We show that finding minimally intersecting n paths from s to t in a directed graph or n perfect matchings in a bipartite graph can be done in polynomial time. This holds more generally for unimodular set systems.
منابع مشابه
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
We deterministically construct quasi-polynomial weights in quasi-polynomial time, such that in a given polytope with totally unimodular constraints, one vertex is isolated, i.e., there is a unique minimum weight vertex. More precisely, the property that we need is that every face of the polytope lies in an affine space defined by a totally unimodular matrix. This derandomizes the famous Isolati...
متن کاملWaveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملComplete Intersection Affine Semigroup Rings Arising from Posets
We apply theorems of Fischer, Morris and Shapiro on affine semigroup rings to show that if a certain affine semigroup ring defined by a poset is a complete intersection, then the poset is either unicyclic or contains a chain, the removal of which increases the number of connected components of the Hasse diagram. This is the converse of a theorem of Boussicault, Feray, Lascoux and Reiner [2]. We...
متن کاملDiscrete Convexity and Unimodularity. I
In this paper we develop a theory of convexity for the lattice of integer points Z, which we call theory of discrete convexity. What subsets X ⊂ Z could be called ”convex”? One property seems indisputable: X should coincide with the set of all integer points of its convex hull co(X). We call such sets pseudo-convex. The resulting class PC of all pseudo-convex sets is stable under intersection b...
متن کاملEnumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices
We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron P(A, 1 ̄ ) = {x ∈ R | Ax ≥ 1 ̄ , x ≥ 0 ̄ }, when A is a totally unimodular matrix. Our algorithm is based on decomposing the hypergraph transversal problem for unimodular hypergraphs using Seymour’s decomposition of totally unimodular matrices, and may be of independent interest.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 43 شماره
صفحات -
تاریخ انتشار 2015