The hardness of routing two pairs on one face

Guyslain Naves (1)

1 G-SCOP_OC - Optimisation Combinatoire

We prove the NP-completeness of the integer multiflow problem in planar graphs, with the following restrictions: there are only two demand edges, both lying on the infinite face of the routing graph. This was one of the open challenges concerning disjoint paths, explicitly asked by Müller. It also strengthens Schwärzler's recent proof of one of the open problems of Schrijver's book, about the complexity of the edge-disjoint paths problem with terminals on the outer boundary of a planar graph. We also give a directed acyclic reduction. This proves that the arc-disjoint paths problem is NP-complete in directed acyclic graphs, even with only two demand arcs.

Mots clés: integer multiflows; planar graphs; disjoint paths; NP-completeness

Domaines: Mathématique discrète [cs.DM]

Guyslain Naves. The hardness of routing two pairs on one face. Mathematical Programming, Series A, 2012, 131 (1 - 2), pp.49 - 69. ⟨10.1007/s10107-010-0343-0⟩. ⟨hal-00313944v2⟩