Events
This week
×
Modal title
Modal content
Monday, 24 July | |||
---|---|---|---|
— no events scheduled — |
Tuesday, 25 July | |||
---|---|---|---|
— no events scheduled — |
Wednesday, 26 July | |||
---|---|---|---|
Time | Speaker | Title | Location |
10:00 - 11:00 |
Prof. Dr. Neil Olvercall_made London School of Economics and Political Science, London, UK |
Abstract
In the strong form of the thin tree conjecture, formulated by Goddyn in 2004, we are given a k-edge-connected graph and wish to find a tree containing at most an O(1/k) fraction of the edges across every cut. This conjecture, if true, has a variety of implications in a number of areas such as graph theory and approximation algorithms. A natural relaxation of this problem is to find a tree with at most O(1/k) edges across a fixed collection of cuts, instead of all cuts. Using iterative relaxation, combined with a simple reduction technique, we show that the thin tree conjecture is true whenever the specified cuts form a laminar family.
Joint work with Nathan Klein.
DACO SeminarThin trees for laminar familiesread_more |
HG G 19.2 |
Thursday, 27 July | |||
---|---|---|---|
Time | Speaker | Title | Location |
10:00 - 11:30 |
Dr. Martin Nägele University of Bonn |
Abstract
We present a new approximation algorithm for the (metric) prize-collecting traveling salesperson problem (PCTSP). In PCTSP, opposed to the classical traveling salesperson problem (TSP), one may choose to not include a vertex of the input graph in the returned tour at the cost of a given vertex-dependent penalty, and the objective is to balance the length of the tour and the incurred penalties for omitted vertices by minimizing the sum of the two. We present an algorithm that achieves an approximation guarantee of 1.774 with respect to the natural linear programming relaxation of the problem. This significantly reduces the gap between the approximability of classical TSP and PCTSP, beating the previously best known approximation factor of 1.915. As a key ingredient of our improvement, we present a refined decomposition technique for solutions of the LP relaxation, and show how to leverage components of that decomposition as building blocks for our tours.
This is joint work with Jannis Blauth.
DACO SeminarAn Improved Approximation Guarantee for Prize-Collecting TSPread_more |
HG G 19.1 |
Friday, 28 July | |||
---|---|---|---|
— no events scheduled — |