Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees

DOI10.1007/11753728_10zbMath1185.68460OpenAlexW1560056453MaRDI QIDQ3434683

Piotr Berman, Martin Fuerer, Alexander Z. Zelikovsky

Publication date: 2 May 2007

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11753728_10

zbMATH Keywords

matroidSteiner treesapproximation ratioparity matroid problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (1)

Algebraic Algorithms for Linear Matroid Parity Problems

This page was built for publication: Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees