Laleh Ghalami, Daniel Grosu. A Family of Fast Parallel Greedy Algorithms for the Steiner Forest Problem. In IEEE International Parallel and Distributed Processing Symposium, IPDPS Workshops 2022, Lyon, France, May 30 - June 3, 2022. pages 764-773, IEEE, 2022. [doi]
@inproceedings{GhalamiG22-1,
title = {A Family of Fast Parallel Greedy Algorithms for the Steiner Forest Problem},
author = {Laleh Ghalami and Daniel Grosu},
year = {2022},
doi = {10.1109/IPDPSW55747.2022.00130},
url = {https://doi.org/10.1109/IPDPSW55747.2022.00130},
researchr = {https://researchr.org/publication/GhalamiG22-1},
cites = {0},
citedby = {0},
pages = {764-773},
booktitle = {IEEE International Parallel and Distributed Processing Symposium, IPDPS Workshops 2022, Lyon, France, May 30 - June 3, 2022},
publisher = {IEEE},
isbn = {978-1-6654-9747-3},
}