%0 Conference Paper %1 conf/sirocco/DAndreaDF0P15 %A D'Andrea, Annalisa %A D'Emidio, Mattia %A Frigioni, Daniele %A Leucci, Stefano %A Proietti, Guido %B SIROCCO %D 2015 %E Scheideler, Christian %I Springer %K dblp %P 224-238 %T Path-Fault-Tolerant Approximate Shortest-Path Trees. %U http://dblp.uni-trier.de/db/conf/sirocco/sirocco2015.html#DAndreaDF0P15 %V 9439 %@ 978-3-319-25257-5

@inproceedings{conf/sirocco/DAndreaDF0P15, added-at = {2022-06-23T00:00:00.000+0200}, author = {D'Andrea, Annalisa and D'Emidio, Mattia and Frigioni, Daniele and Leucci, Stefano and Proietti, Guido}, biburl = {https://www.bibsonomy.org/bibtex/2cbff5707c8aade1411575a94a55a4883/dblp}, booktitle = {SIROCCO}, crossref = {conf/sirocco/2015}, editor = {Scheideler, Christian}, ee = {https://doi.org/10.1007/978-3-319-25258-2_16}, interhash = {603c3927745dfba3c6ab079523a09784}, intrahash = {cbff5707c8aade1411575a94a55a4883}, isbn = {978-3-319-25257-5}, keywords = {dblp}, pages = {224-238}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T03:46:58.000+0200}, title = {Path-Fault-Tolerant Approximate Shortest-Path Trees.}, url = {http://dblp.uni-trier.de/db/conf/sirocco/sirocco2015.html#DAndreaDF0P15}, volume = 9439, year = 2015 }