Approximating Directed Steiner Problems via Tree Embedding

DOI10.4230/LIPIcs.ICALP.2016.74zbMath1388.68235arXiv1511.06559OpenAlexW2963282726MaRDI QIDQ4598214

Bundit Laekhanukit

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1511.06559

zbMATH Keywords

directed graphnetwork designgraph connectivityapproximation algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (3)

$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths ⋮ Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs

This page was built for publication: Approximating Directed Steiner Problems via Tree Embedding