The unimodular intersection problem

Volker Kaibel; Shmuel Onn; Pauline Sarrabezolles

doi:https://doi.org/10.1016/j.orl.2015.09.005

The unimodular intersection problem

Volker Kaibel, Shmuel Onn, Pauline Sarrabezolles

Data and Decision Sciences

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

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, and follows from a more general result on the shifted problem over such systems.

Original language	English
Pages (from-to)	592-594
Number of pages	3
Journal	Operations Research Letters
Volume	43
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2015.09.005
State	Published - 1 Nov 2015

Keywords

Combinatorial optimization
Graph
Integer programming
Matching
Path
Unimodular

All Science Journal Classification (ASJC) codes

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

https://doi.org/10.1016/j.orl.2015.09.005

Cite this

@article{562906f7c25e4216a105532acdb39829,

title = "The unimodular intersection problem",

abstract = "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, and follows from a more general result on the shifted problem over such systems.",

keywords = "Combinatorial optimization, Graph, Integer programming, Matching, Path, Unimodular",

author = "Volker Kaibel and Shmuel Onn and Pauline Sarrabezolles",

year = "2015",

month = nov,

day = "1",

doi = "https://doi.org/10.1016/j.orl.2015.09.005",

language = "الإنجليزيّة",

volume = "43",

pages = "592--594",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - The unimodular intersection problem

AU - Kaibel, Volker

AU - Onn, Shmuel

AU - Sarrabezolles, Pauline

PY - 2015/11/1

Y1 - 2015/11/1

N2 - 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, and follows from a more general result on the shifted problem over such systems.

AB - 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, and follows from a more general result on the shifted problem over such systems.

KW - Combinatorial optimization

KW - Graph

KW - Integer programming

KW - Matching

KW - Path

KW - Unimodular

UR - http://www.scopus.com/inward/record.url?scp=84943398234&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.orl.2015.09.005

DO - https://doi.org/10.1016/j.orl.2015.09.005

M3 - مقالة

SN - 0167-6377

VL - 43

SP - 592

EP - 594

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

The unimodular intersection problem

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this