%0 Conference Paper %1 conf/icde/LiuJYZ18a %A Liu, Huiping %A Jin, Cheqing %A Yang, Bin %A Zhou, Aoying %B ICDE %D 2018 %I IEEE Computer Society %K dblp %P 1761-1762 %T Finding Top-k Shortest Paths with Diversity. %U http://dblp.uni-trier.de/db/conf/icde/icde2018.html#LiuJYZ18a %@ 978-1-5386-5520-7

@inproceedings{conf/icde/LiuJYZ18a, added-at = {2023-03-24T00:00:00.000+0100}, author = {Liu, Huiping and Jin, Cheqing and Yang, Bin and Zhou, Aoying}, biburl = {https://www.bibsonomy.org/bibtex/2e7e38e263a6ab2db4847282887db9c4c/dblp}, booktitle = {ICDE}, crossref = {conf/icde/2018}, ee = {https://doi.ieeecomputersociety.org/10.1109/ICDE.2018.00238}, interhash = {73d03156e835ce172cbd352710eb525c}, intrahash = {e7e38e263a6ab2db4847282887db9c4c}, isbn = {978-1-5386-5520-7}, keywords = {dblp}, pages = {1761-1762}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T18:39:37.000+0200}, title = {Finding Top-k Shortest Paths with Diversity.}, url = {http://dblp.uni-trier.de/db/conf/icde/icde2018.html#LiuJYZ18a}, year = 2018 }