✦ LIBER ✦

Improved Steiner tree algorithms for bounded treewidth

✍ Scribed by Chimani, Markus; Mutzel, Petra; Zey, Bernd

Book ID: 119292782
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 425 KB
Volume: 16
Category: Article
ISSN: 1570-8667
DOI: 10.1016/j.jda.2012.04.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic Algorithms for Graphs of Bounded

Dynamic Algorithms for Graphs of Bounded Treewidth

✍ T. Hagerup 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 181 KB

Parallel Algorithms with Optimal Speedup

Parallel Algorithms with Optimal Speedup for Bounded Treewidth

✍ Bodlaender, Hans L.; Hagerup, Torben 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 371 KB

Improved Approximation Algorithms for Pr

Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP

✍ Archer, Aaron; Bateni, MohammadHossein; Hajiaghayi, MohammadTaghi; Karloff, Howa 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 317 KB

Restricted space algorithms for isomorph

Restricted space algorithms for isomorphism on bounded treewidth graphs

✍ Bireswar Das; Jacobo Torán; Fabian Wagner 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 297 KB

I/O-Efficient Algorithms for Graphs of B

I/O-Efficient Algorithms for Graphs of Bounded Treewidth

✍ Anil Maheshwari; Norbert Zeh 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 976 KB

Lower bounds for the relative greedy alg

Lower bounds for the relative greedy algorithm for approximating Steiner trees

✍ Stefan Hougardy; Stefan Kirchner 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB