Learn More

- Loïc Seguin-Charbonneau, F. Bruce Shepherd
- 2011 IEEE 52nd Annual Symposium on Foundations of…
- 2011

We study the maximum edge-disjoint path problem (MEDP) in planar graphs. We are given a set of terminal pairs and wish to find a maximum routable subset of demands. That is, a subset of demands that can be connected by edge-disjoint paths. It is well-known that there is an integrality gap of order square root of the number of nodes for this problem even on… (More)

- ‹
- 1
- ›