%0 Journal Article %1 journals/algorithmica/BiloGLP22 %A Bilò, Davide %A Gualà, Luciano %A Leucci, Stefano %A Proietti, Guido %D 2022 %J Algorithmica %K dblp %N 1 %P 37-59 %T Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica84.html#BiloGLP22 %V 84

@article{journals/algorithmica/BiloGLP22, added-at = {2022-06-23T00:00:00.000+0200}, author = {Bilò, Davide and Gualà, Luciano and Leucci, Stefano and Proietti, Guido}, biburl = {https://www.bibsonomy.org/bibtex/2e0616bcbf3843f2f473a1c204d2ac111/dblp}, ee = {https://doi.org/10.1007/s00453-021-00879-8}, interhash = {9bb331bf7ee09bea7d02534896cb50f4}, intrahash = {e0616bcbf3843f2f473a1c204d2ac111}, journal = {Algorithmica}, keywords = {dblp}, number = 1, pages = {37-59}, timestamp = {2024-04-08T18:20:54.000+0200}, title = {Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica84.html#BiloGLP22}, volume = 84, year = 2022 }