{
  "id": "1410.7208",
  "version": "v1",
  "published": "2014-10-27T12:45:39.000Z",
  "updated": "2014-10-27T12:45:39.000Z",
  "title": "A combinatorial algorithm for the planar multiflow problem with demands located on three holes",
  "authors": [
    "Maxim A. Babenko",
    "Alexander V. Karzanov"
  ],
  "comment": "16 pages, 4 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "We consider an undirected multi(commodity)flow demand problem in which a supply graph is planar, each source-sink pair is located on one of three specified faces of the graph, and the capacities and demands are integer-valued and Eulerian. It is known that such a problem has a solution if the cut and (2,3)-metric conditions hold, and that the solvability implies the existence of an integer solution. We develop a purely combinatorial strongly polynomial solution algorithm.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-10-27T12:45:39.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "90C27",
      "05C10",
      "05C21",
      "05C85"
    ],
    "keywords": [
      "planar multiflow problem",
      "combinatorial algorithm",
      "combinatorial strongly polynomial solution algorithm",
      "purely combinatorial strongly polynomial solution"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1410.7208B"
    }
  }
}