- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Surviving in Directed Graphs: A Quasi-polynomial-time...
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation for Two-connected Directed Steiner Tree Grandoni, Fabrizio
Description
Joint work with Bundit Laekhanukit The high-level goal of survivable network design is to design cheap networks that satisfy giving connectivity requirements even in the preserve of node or edge faults. While many approximation algorithms are known for a variety of such problems in undirected graphs, not much is known for directed ones. In this work we present the first non-trivial approximation algorithm for the 2-edge connectivity generalization of Directed Steiner Tree (DST). Analogously to DST, our approach gives a polylogarithmic approximation in quasi-polynomial time, or an $n^{\epsilon}$ approximation in polynomial time. Our approach is based on a complex LP-rounding algorithm that combines the notion of divergent trees and Zelikosky’s height reduction via a probabilistic mapping.
Item Metadata
Title |
Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation for Two-connected Directed Steiner Tree
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2017-11-14T11:37
|
Description |
Joint work with Bundit Laekhanukit
The high-level goal of survivable network design is to design cheap
networks that satisfy giving connectivity requirements even in the
preserve of node or edge faults. While many approximation algorithms
are known for a variety of such problems in undirected graphs, not
much is known for directed ones. In this work we present the first
non-trivial approximation algorithm for the 2-edge connectivity
generalization of Directed Steiner Tree (DST). Analogously to DST, our
approach gives a polylogarithmic approximation in quasi-polynomial
time, or an $n^{\epsilon}$ approximation in polynomial time. Our
approach is based on a complex LP-rounding algorithm that combines the
notion of divergent trees and Zelikosky’s height reduction via a
probabilistic mapping.
|
Extent |
27 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: IDSIA, University of Lugano
|
Series | |
Date Available |
2018-05-14
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0366271
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Faculty
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International