## University COVID-19 update

### Questions about buildings and services? Visit the list of Modified Services.

Please note: The University of Waterloo is closed for all events until further notice.

# Tutte Colloquium - Matthias Mnich

Friday, October 19, 2018 — 3:30 PM EDT

Title: New algorithms for maximum disjoint paths based on tree-likeness

 Speaker: Matthias Mnich Affiliation: University of Bonn Room: MC 5501

Abstract:

We study the classical NP-hard problems of finding maximum-size subsets from given sets of k terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint paths (MaxNDP) in a given graph. The approximability of MaxEDP/MaxNDP is currently not well understood; the best known lower bound is $2Ω(√log n), assuming$\mbox{NP}\subsetneq \mbox{DTIME}(n^{O(log n)})\$. This constitutes a significant gap to the best known approximation upper bound of O(√n) due to Chekuri et al. (2006), and closing this gap is currently one of the big open problems in approximation algorithms. In their seminal paper, Raghavan and Thompson (1987) introduce the technique of randomized rounding for LPs; their technique gives an O(1)-approximation when edges (or nodes) may be used by O(log n/log log n) paths.

We strengthen the fundamental results above. We provide new bounds formulated in terms of the feedback vertex set number r of a graph, which measures its vertex deletion distance to a forest. In particular, we obtain the following results:

(1) For MaxEDP, we give an O(√rlog(kr))-approximation algorithm. Up to a logarithmic factor, our result strengthens the best known ratio O(√n) due to Chekuri et al., as r≤n.

2) Further, we show how to route Ω(OPT*) pairs with congestion bounded by O(log(kr)/log log(kr)), strengthening the bound obtained by the classic approach of Raghavan and Thompson.

(3) For MaxNDP, we give an algorithm that gives the optimal answer in time (k+r)O(r)n. This is a substantial improvement on the run time of 2krO(r)n, , which can be obtained via an algorithm by Scheffler.

We complement these positive results by proving that MaxEDP is NP-hard even for r=1, and MaxNDP is W[1]-hard when r is the parameter. This shows that neither problem is fixed-parameter tractable in r unless FPT=W[1]and that our approximability results are relevant even for very small constant values of r.

Appeared in Math. Programming, September 2018. Joint work with Joachim Spoerhase (Aalto) and Krzysztof Fleszar (Warsaw).

Location
MC - Mathematics & Computer Building
5501
200 University Avenue West

Waterloo, ON N2L 3G1

### April 2021

S M T W T F S
28
29
30
31
2
3
4
5
6
7
10
11
13
14
17
18
20
21
22
24
25
27
28
29
30
1
1. 2021 (40)
1. April (9)
2. March (13)
3. February (8)
4. January (10)
2. 2020 (119)
1. December (5)
2. November (12)
3. October (12)
4. September (12)
5. August (11)
6. July (17)
7. June (11)
8. May (6)
9. March (11)
10. February (11)
11. January (11)
3. 2019 (167)
4. 2018 (136)
5. 2017 (103)
6. 2016 (137)
7. 2015 (136)
8. 2014 (88)
9. 2013 (48)
10. 2012 (39)
11. 2011 (36)
12. 2010 (40)
13. 2009 (40)
14. 2008 (39)
15. 2007 (15)