Go to the corresponding LIPIcs Volume Portal 
Bilò, Davide ; D'Angelo, Gianlorenzo ; Gualà, Luciano ; Leucci, Stefano ; Proietti, Guido ; Rossi, Mirko
pdfformat: 

@InProceedings{bilo_et_al:LIPIcs.STACS.2022.12, author = {Bil\`{o}, Davide and D'Angelo, Gianlorenzo and Gual\`{a}, Luciano and Leucci, Stefano and Proietti, Guido and Rossi, Mirko}, title = {{SingleSource Shortest pDisjoint Paths: Fast Computation and Sparse Preservers}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {12:112:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772228}, ISSN = {18688969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra and Monmege, Benjamin}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15822}, URN = {urn:nbn:de:0030drops158221}, doi = {10.4230/LIPIcs.STACS.2022.12}, annote = {Keywords: multipath spanners, graph sparsification, edgedisjoint paths, mincost flow} }
Keywords:  multipath spanners, graph sparsification, edgedisjoint paths, mincost flow  
Collection:  39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)  
Issue Date:  2022  
Date of publication:  09.03.2022 