On computing Pareto optimal paths in weighted time-dependent networks. Brunelli, F., Crescenzi, P., & Viennot, L. Inf. Process. Lett., 168:106086, 2021. Paper doi bibtex @article{DBLP:journals/ipl/BrunelliCV21,
author = {Filippo Brunelli and Pierluigi Crescenzi and Laurent Viennot},
bibsource = {dblp computer science bibliography, https://dblp.org},
biburl = {https://dblp.org/rec/journals/ipl/BrunelliCV21.bib},
date-added = {2021-05-07 15:08:15 +0200},
date-modified = {2021-05-07 15:08:15 +0200},
doi = {10.1016/j.ipl.2020.106086},
journal = {Inf. Process. Lett.},
pages = {106086},
timestamp = {Thu, 29 Apr 2021 15:14:58 +0200},
title = {On computing Pareto optimal paths in weighted time-dependent networks},
url = {https://doi.org/10.1016/j.ipl.2020.106086},
volume = {168},
year = {2021},
Bdsk-Url-1 = {https://doi.org/10.1016/j.ipl.2020.106086}}
Downloads: 0
{"_id":"6CBPDWZarjYBAwAKQ","bibbaseid":"brunelli-crescenzi-viennot-oncomputingparetooptimalpathsinweightedtimedependentnetworks-2021","author_short":["Brunelli, F.","Crescenzi, P.","Viennot, L."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Filippo"],"propositions":[],"lastnames":["Brunelli"],"suffixes":[]},{"firstnames":["Pierluigi"],"propositions":[],"lastnames":["Crescenzi"],"suffixes":[]},{"firstnames":["Laurent"],"propositions":[],"lastnames":["Viennot"],"suffixes":[]}],"bibsource":"dblp computer science bibliography, https://dblp.org","biburl":"https://dblp.org/rec/journals/ipl/BrunelliCV21.bib","date-added":"2021-05-07 15:08:15 +0200","date-modified":"2021-05-07 15:08:15 +0200","doi":"10.1016/j.ipl.2020.106086","journal":"Inf. Process. Lett.","pages":"106086","timestamp":"Thu, 29 Apr 2021 15:14:58 +0200","title":"On computing Pareto optimal paths in weighted time-dependent networks","url":"https://doi.org/10.1016/j.ipl.2020.106086","volume":"168","year":"2021","bdsk-url-1":"https://doi.org/10.1016/j.ipl.2020.106086","bibtex":"@article{DBLP:journals/ipl/BrunelliCV21,\n\tauthor = {Filippo Brunelli and Pierluigi Crescenzi and Laurent Viennot},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/ipl/BrunelliCV21.bib},\n\tdate-added = {2021-05-07 15:08:15 +0200},\n\tdate-modified = {2021-05-07 15:08:15 +0200},\n\tdoi = {10.1016/j.ipl.2020.106086},\n\tjournal = {Inf. Process. Lett.},\n\tpages = {106086},\n\ttimestamp = {Thu, 29 Apr 2021 15:14:58 +0200},\n\ttitle = {On computing Pareto optimal paths in weighted time-dependent networks},\n\turl = {https://doi.org/10.1016/j.ipl.2020.106086},\n\tvolume = {168},\n\tyear = {2021},\n\tBdsk-Url-1 = {https://doi.org/10.1016/j.ipl.2020.106086}}\n\n","author_short":["Brunelli, F.","Crescenzi, P.","Viennot, L."],"key":"DBLP:journals/ipl/BrunelliCV21","id":"DBLP:journals/ipl/BrunelliCV21","bibbaseid":"brunelli-crescenzi-viennot-oncomputingparetooptimalpathsinweightedtimedependentnetworks-2021","role":"author","urls":{"Paper":"https://doi.org/10.1016/j.ipl.2020.106086"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://drive.google.com/uc?export=download&id=19WpQhoMIwJIL1DMqKywl2YoH2M7MIki5","dataSources":["RKZzE9qbnqyegdbZi","kCt8NvHdC72dHkmfu"],"keywords":[],"search_terms":["computing","pareto","optimal","paths","weighted","time","dependent","networks","brunelli","crescenzi","viennot"],"title":"On computing Pareto optimal paths in weighted time-dependent networks","year":2021}