Minimum multicuts and Steiner forests for Okamura-Seymour graphs

Arindam Pal

We study the problem of finding minimum multicuts for an undirected planar graph, where all the terminal vertices are on the boundary of the outer face. This is known as an Okamura…