![](/files/happy5.png)
approximation algorithms
Approximation ratio for k-outerplanar graphs ★★
Author(s): Bentz
Conjecture Is the approximation ratio for the Maximum Edge Disjoint Paths (MaxEDP) or the Maximum Integer Multiflow problem (MaxIMF) bounded by a constant in
-outerplanar graphs or tree-width graphs?
![$ k $](/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png)
Keywords: approximation algorithms; planar graph; polynomial algorithm
Approximation Ratio for Maximum Edge Disjoint Paths problem ★★
Author(s): Bentz
Conjecture Can the approximation ratio
be improved for the Maximum Edge Disjoint Paths problem (MaxEDP) in planar graphs or can an inapproximability result stronger than
-hardness?
![$ O(\sqrt{n}) $](/files/tex/f1253d4c08d28b4696a2d2970370ca3ff8009cf2.png)
![$ \mathcal{APX} $](/files/tex/192453ccba701cc835624b0ec02d0a48c6a36e73.png)
Keywords: approximation algorithms; Disjoint paths; planar graph; polynomial algorithm
![Syndicate content Syndicate content](/misc/feed.png)