Piotr Berman, Martin Fürer, Alexander Zelikovsky. Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. In Dima Grigoriev, John Harrison, Edward A. Hirsch, editors, Computer Science - Theory and Applications, First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings. Volume 3967 of Lecture Notes in Computer Science, pages 70-79, Springer, 2006. [doi]
@inproceedings{BermanFZ06,
title = {Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees},
author = {Piotr Berman and Martin Fürer and Alexander Zelikovsky},
year = {2006},
doi = {10.1007/11753728_10},
url = {http://dx.doi.org/10.1007/11753728_10},
researchr = {https://researchr.org/publication/BermanFZ06},
cites = {0},
citedby = {0},
pages = {70-79},
booktitle = {Computer Science - Theory and Applications, First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings},
editor = {Dima Grigoriev and John Harrison and Edward A. Hirsch},
volume = {3967},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-34166-8},
}