Packing element-disjoint steiner trees

DOI10.1145/1290672.1290684zbMath1445.68155OpenAlexW1992520347MaRDI QIDQ4962687

Mohammad R. Salavatipour, Joseph Cheriyan

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1290672.1290684

zbMATH Keywords

packingapproximation algorithmsSteiner treeshardness of approximationelement-disjoint

Mathematics Subject Classification ID

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

Related Items (3)

Reliability assessment of the divide-and-swap cube in terms of generalized connectivity ⋮ Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth

This page was built for publication: Packing element-disjoint steiner trees