{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T11:02:13Z","timestamp":1775473333012,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s11390-024-2635-5","type":"journal-article","created":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:20:48Z","timestamp":1737004848000},"page":"1380-1400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Personalized Privacy-Preserving Routing Mechanism Design in Payment Channel Network"],"prefix":"10.1007","volume":"39","author":[{"given":"Peng-Cheng","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Jie","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,16]]},"reference":[{"key":"2635_CR1","volume-title":"Bitcoin","author":"S Nakamoto","year":"2008","unstructured":"Nakamoto S. Bitcoin: A peer-to-peer electronic cash system. Bitcoin, 2008."},{"key":"2635_CR2","volume-title":"Etherum","author":"V Buterin","year":"2014","unstructured":"Buterin V. A next-generation smart contract and decentralized application platform. Etherum, 2014."},{"key":"2635_CR3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9149301","volume-title":"Proc. the 2020 IEEE International Conference on Communications (ICC)","author":"J Xu","year":"2020","unstructured":"Xu J, Wu Y, Luo X, Yang D. Improving the efficiency of blockchain applications with smart contract based cyber-insurance. In Proc. the 2020 IEEE International Conference on Communications (ICC), Jun. 2020. DOI: https:\/\/doi.org\/10.1109\/ICC40277.2020.9149301."},{"key":"2635_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-21741-3_1","volume-title":"Proc. the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems","author":"C Decker","year":"2015","unstructured":"Decker C, Wattenhofer R. A fast and scalable payment network with bitcoin duplex micropayment channels. In Proc. the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Aug. 2015, pp.3\u201318. DOI: https:\/\/doi.org\/10.1007\/978-3-319-21741-3_1."},{"key":"2635_CR5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761804","volume-title":"Proc. the 2019 IEEE International Conference on Communications (ICC)","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Yang D, Xue G. CheaPay: An optimal algorithm for fee minimization in blockchain-based payment channel networks. In Proc. the 2019 IEEE International Conference on Communications (ICC), May. 2019. DOI: https:\/\/doi.org\/10.1109\/ICC.2019.8761804."},{"key":"2635_CR6","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/Cybermatics_2018.2018.00209","volume-title":"Proc. the 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)","author":"G Di Stasi","year":"2018","unstructured":"Di Stasi G, Avallone S, Canonico R, Ventre G. Routing payments on the lightning network. In Proc. the 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), Jul. 30\u2013Aug. 3, 2018, pp.1161\u20131170. DOI: https:\/\/doi.org\/10.1109\/Cybermatics_2018.2018.00209."},{"key":"2635_CR7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2018.8487351","volume-title":"Proc. the 27th International Conference on Computer Communication and Networks (ICCCN)","author":"R Yu","year":"2018","unstructured":"Yu R, Xue G, Kilari V T, Yang D, Tang J. CoinExpress: A fast payment routing mechanism in blockchain-based payment channel networks. In Proc. the 27th International Conference on Computer Communication and Networks (ICCCN), Jul. 30\u2013Aug. 2, 2018. DOI: https:\/\/doi.org\/10.1109\/ICCCN.2018.8487351."},{"key":"2635_CR8","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/INFOCOM.2019.8737594","volume-title":"Proc. the 2019 IEEE Conference on Computer Communications","author":"Z Wang","year":"2019","unstructured":"Wang Z, Li J, Hu J, Ren J, Li Z, Li Y. Towards privacy-preserving incentive for mobile crowdsensing under an untrusted platform. In Proc. the 2019 IEEE Conference on Computer Communications, Apr. 29\u2013May 2, 2019, pp.2053\u20132061. DOI: https:\/\/doi.org\/10.1109\/INFOCOM.2019.8737594."},{"issue":"8","key":"2635_CR9","doi-asserted-by":"publisher","first-page":"4664","DOI":"10.1109\/TMC.2022.3162108","volume":"22","author":"J Xu","year":"2023","unstructured":"Xu J, Luo Z, Guan C, Yang D, Liu L, Zhang Y. Hiring a team from social network: Incentive mechanism design for two-tiered social mobile crowdsourcing. IEEE Trans. Mobile Computing, 2023, 22(8): 4664\u20134681. DOI: https:\/\/doi.org\/10.1109\/TMC.2022.3162108.","journal-title":"IEEE Trans. Mobile Computing"},{"issue":"7","key":"2635_CR10","doi-asserted-by":"publisher","first-page":"1618","DOI":"10.1109\/TMC.2019.2911512","volume":"19","author":"J Xu","year":"2020","unstructured":"Xu J, Rao Z, Xu L, Yang D, Li T. Incentive mechanism for multiple cooperative tasks with compatible users in mobile crowd sensing via online communities. IEEE Trans. Mobile Computing, 2020, 19(7): 1618\u20131633. DOI: https:\/\/doi.org\/10.1109\/TMC.2019.2911512.","journal-title":"IEEE Trans. Mobile Computing"},{"issue":"6","key":"2635_CR11","doi-asserted-by":"publisher","first-page":"6122","DOI":"10.1109\/TVT.2021.3079258","volume":"70","author":"W Lu","year":"2021","unstructured":"Lu W, Zhang S, Xu J, Yang D, Xu L. Truthful multi-resource transaction mechanism for P2P task offloading based on edge computing. IEEE Trans. Vehicular Technology, 2021, 70(6): 6122\u20136135. DOI: https:\/\/doi.org\/10.1109\/TVT.2021.3079258.","journal-title":"IEEE Trans. Vehicular Technology"},{"issue":"4","key":"2635_CR12","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1109\/TMC.2019.2901474","volume":"19","author":"D Zhang","year":"2020","unstructured":"Zhang D, Tan L, Ren J, Awad M, Zhang S, Zhang Y, Wan P. Near-optimal and truthful online auction for computation offloading in green edge-computing systems. IEEE Trans. Mobile Computing, 2020, 19(4): 880\u2013893. DOI: https:\/\/doi.org\/10.1109\/TMC.2019.2901474.","journal-title":"IEEE Trans. Mobile Computing"},{"key":"2635_CR13","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/INFOCOM41043.2020.91552-79","volume-title":"Proc. the 2020 IEEE Conference on Computer Communications","author":"K Cheng","year":"2020","unstructured":"Cheng K, Wang L, Shen Y, Liu Y, Wang Y, Zheng L. A lightweight auction framework for spectrum allocation with strong security guarantees. In Proc. the 2020 IEEE Conference on Computer Communications, Jul. 2020, pp.1708\u20131717. DOI: https:\/\/doi.org\/10.1109\/INFOCOM41043.2020.91552-79."},{"issue":"2","key":"2635_CR14","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10796-020-10019-2","volume":"23","author":"G Xue","year":"2021","unstructured":"Xue G, Xu J, Wu H, Lu W, Xu L. Incentive mechanism for rational miners in Bitcoin mining pool. Information Systems Frontiers, 2021, 23(2): 317\u2013327. DOI: https:\/\/doi.org\/10.1007\/s10796-020-10019-2.","journal-title":"Information Systems Frontiers"},{"key":"2635_CR15","doi-asserted-by":"publisher","first-page":"3460","DOI":"10.1109\/GLOCOM.2005.1578416","volume-title":"Proc. the 2005 IEEE Global Telecommunications Conference","author":"Y Wang","year":"2005","unstructured":"Wang Y, Wang W, Dahlberg T A. Truthful routing for wireless hybrid networks. In Proc. the 2005 IEEE Global Telecommunications Conference, Nov. 28\u2013Dec. 2, 2005, pp.3460\u20133465. DOI: https:\/\/doi.org\/10.1109\/GLOCOM.2005.1578416."},{"key":"2635_CR16","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1109\/FOCS.2007.66","volume-title":"Proc. the 48th Annual IEEE Symposium on Foundations of Computer Science","author":"F McSherry","year":"2007","unstructured":"McSherry F, Talwar K. Mechanism design via differential privacy. In Proc. the 48th Annual IEEE Symposium on Foundations of Computer Science, Oct. 2007, pp.94\u2013103. DOI: https:\/\/doi.org\/10.1109\/FOCS.2007.66."},{"key":"2635_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1","volume-title":"Proc. the 5th International Conference on Theory and Applications of Models of Computation","author":"C Dwork","year":"2008","unstructured":"Dwork C. Differential privacy: A survey of results. In Proc. the 5th International Conference on Theory and Applications of Models of Computation, Apr. 2008. DOI: https:\/\/doi.org\/10.1007\/978-3-540-79228-4_1."},{"issue":"1","key":"2635_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1010066509278","volume":"1","author":"K A Wallace","year":"1999","unstructured":"Wallace K A. Anonymity. Ethics and Information Technology, 1999, 1(1): 21\u201331. DOI: https:\/\/doi.org\/10.1023\/A:1010066509278.","journal-title":"Ethics and Information Technology"},{"issue":"2","key":"2635_CR19","doi-asserted-by":"publisher","first-page":"256","DOI":"10.17762\/ijcnis.v12i2.4698","volume":"12","author":"M N Alenezi","year":"2022","unstructured":"Alenezi M N, Alabdulrazzaq H K, Mohammad N Q. Symmetric encryption algorithms: Review and evaluation study. International Journal of Communication Networks and Information Security, 2022, 12(2): 256\u2013272. DOI: https:\/\/doi.org\/10.17762\/ijcnis.v12i2.4698.","journal-title":"International Journal of Communication Networks and Information Security"},{"issue":"6","key":"2635_CR20","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1109\/TMC.2018.2861393","volume":"18","author":"Z Wang","year":"2019","unstructured":"Wang Z, Hu J, Lv R, Wei J, Wang Q, Yang D, Qi H. Personalized privacy-preserving task allocation for mobile crowdsensing. IEEE Trans. Mobile Computing, 2019, 18(6): 1330\u20131341. DOI: https:\/\/doi.org\/10.1109\/TMC.2018.2861393.","journal-title":"IEEE Trans. Mobile Computing"},{"key":"2635_CR21","volume-title":"Proc. the 3rd International Symposium on Foundations and Applications of Blockchain","author":"X Zhang","year":"2020","unstructured":"Zhang X, Shi S, Qian C. Scalable decentralized routing for blockchain payment networks. In Proc. the 3rd International Symposium on Foundations and Applications of Blockchain, May 2020."},{"key":"2635_CR22","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/3133956.3134033","volume-title":"Proc. the 2017 ACM SIGSAC Conference on Computer and Communications Security","author":"R Khalil","year":"2017","unstructured":"Khalil R, Gervais A. Revive: Rebalancing off-blockchain payment networks. In Proc. the 2017 ACM SIGSAC Conference on Computer and Communications Security, Oct. 2017, pp.439\u2013453. DOI: https:\/\/doi.org\/10.1145\/3133956.3134033."},{"key":"2635_CR23","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2019.8888094","volume-title":"Proc. the 27th International Conference on Network Protocols (ICNP)","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Yang D. RobustPay: Robust payment routing protocol in blockchain-based payment channel networks. In Proc. the 27th International Conference on Network Protocols (ICNP), Oct. 2019. DOI: https:\/\/doi.org\/10.1109\/ICNP.2019.8888094."},{"key":"2635_CR24","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-54455-3_34","volume-title":"Proc. the 2020 International Conference on Financial Cryptography and Data Security","author":"S Tripathy","year":"2020","unstructured":"Tripathy S, Mohanty S K. MAPPCN: Multi-hop anonymous and privacy-preserving payment channel network. In Proc. the 2020 International Conference on Financial Cryptography and Data Security, Feb. 2020, pp.481\u2013495. DOI: https:\/\/doi.org\/10.1007\/978-3-030-54455-3_34."},{"issue":"2","key":"2635_CR25","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1109\/TDSC.2022.3148476","volume":"20","author":"S Mazumdar","year":"2023","unstructured":"Mazumdar S, Ruj S. CryptoMaze: Privacy-preserving splitting of off-chain payments. IEEE Trans. Dependable and Secure Computing, 2023, 20(2): 1060\u20131073. DOI: https:\/\/doi.org\/10.1109\/TDSC.2022.3148476.","journal-title":"IEEE Trans. Dependable and Secure Computing"},{"key":"2635_CR26","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-030-31919-9_18","volume-title":"Proc. the 13th International Conference on Provable Security","author":"B Yu","year":"2019","unstructured":"Yu B, Kermanshahi S K, Sakzad A, Nepal S. Chameleon hash time-lock contract for privacy preserving payment channel networks. In Proc. the 13th International Conference on Provable Security, Oct. 2019, pp.303\u2013318. DOI: https:\/\/doi.org\/10.1007\/978-3-030-31919-9_18."},{"key":"2635_CR27","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/3321705.3329812","volume-title":"Proc. the 2019 ACM Asia Conference on Computer and Communications Security","author":"J Herrera-Joancomarti","year":"2019","unstructured":"Herrera-Joancomarti J, Navarro-Arribas G, Ranchal-Pedrosa A, Perez-Sola C, Garcia-Alfaro J. On the difficulty of hiding the balance of lightning network channels. In Proc. the 2019 ACM Asia Conference on Computer and Communications Security, Jul. 2019, pp.602\u2013612. DOI: https:\/\/doi.org\/10.1145\/3321705.3329812."},{"key":"2635_CR28","doi-asserted-by":"publisher","DOI":"10.1145\/3392147","volume-title":"Proc. the 2020 ACM on Measurement and Analysis of Computing Systems","author":"W Tang","year":"2020","unstructured":"Tang W, Wang W, Fanti G, Oh S. Privacy-utility tradeoffs in routing cryptocurrency over payment channel networks. In Proc. the 2020 ACM on Measurement and Analysis of Computing Systems, Jun. 2020, Article No. 29. DOI: https:\/\/doi.org\/10.1145\/3392147."},{"key":"2635_CR29","doi-asserted-by":"publisher","first-page":"455","DOI":"10.48550\/arXiv.1709.05748","volume-title":"Proc. the 25th Annual Network and Distributed System Security Symposium","author":"S Roos","year":"2018","unstructured":"Roos S, Moreno-Sanchez P, Kate A, Goldberg I. Settling payments fast and private: Efficient decentralized routing for path-based transactions. In Proc. the 25th Annual Network and Distributed System Security Symposium, Feb. 2018, pp.455\u2013471. DOI: https:\/\/doi.org\/10.48550\/arXiv.1709.05748."},{"key":"2635_CR30","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9149447","volume-title":"Proc. the 2020 IEEE International Conference on Communications (ICC)","author":"P Li","year":"2020","unstructured":"Li P, Luo X F, Miyazaki T, Guo S. Privacy-preserving payment channel networks using trusted execution environment. In Proc. the 2020 IEEE International Conference on Communications (ICC), Jun. 2020. DOI: https:\/\/doi.org\/10.1109\/ICC40277.2020.9149447."},{"key":"2635_CR31","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC45663.2020.9120532","volume-title":"Proc. the 2020 IEEE Wireless Communications and Networking Conference (WCNC)","author":"B Niu","year":"2020","unstructured":"Niu B, Chen Y, Wang B, Cao J, Li F. Utility-aware exponential mechanism for personalized differential privacy. In Proc. the 2020 IEEE Wireless Communications and Networking Conference (WCNC), May 2020. DOI: https:\/\/doi.org\/10.1109\/WCNC45663.2020.9120532."},{"key":"2635_CR32","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1109\/ICDE.2015.7113353","volume-title":"Proc. the 31st International Conference on Data Engineering","author":"Z Jorgensen","year":"2015","unstructured":"Jorgensen Z, Yu T, Cormode G. Conservative or liberal? Personalized differential privacy. In Proc. the 31st International Conference on Data Engineering, Apr. 2015, pp.1023\u20131034. DOI: https:\/\/doi.org\/10.1109\/ICDE.2015.7113353."},{"key":"2635_CR33","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1109\/FOCS.2013.53","volume-title":"Proc. the 54th Annual Symposium on Foundations of Computer Science","author":"J C Duchi","year":"2013","unstructured":"Duchi J C, Jordan M I, Wainwright M J. Local privacy and statistical minimax rates. In Proc. the 54th Annual Symposium on Foundations of Computer Science, Oct. 2013, pp.429\u2013438. DOI: https:\/\/doi.org\/10.1109\/FOCS.2013.53."},{"issue":"3","key":"2635_CR34","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1109\/TNET.2018.2823272","volume":"26","author":"X Jin","year":"2018","unstructured":"Jin X, Zhang Y. Privacy-preserving crowdsourced spectrum sensing. IEEE\/ACM Trans. Networking, 2018, 26(3): 1236\u20131249. DOI: https:\/\/doi.org\/10.1109\/TNET.2018.2823272.","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"8","key":"2635_CR35","doi-asserted-by":"publisher","first-page":"1851","DOI":"10.1109\/TMC.2017.2780091","volume":"17","author":"J Lin","year":"2018","unstructured":"Lin J, Yang D, Li M, Xu J, Xue G. Frameworks for privacy-preserving mobile crowdsensing incentive mechanisms. IEEE Trans. Mobile Computing, 2018, 17(8): 1851\u20131864. DOI: https:\/\/doi.org\/10.1109\/TMC.2017.2780091.","journal-title":"IEEE Trans. Mobile Computing"},{"key":"2635_CR36","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.cose.2018.12.017","volume":"82","author":"D Lv","year":"2019","unstructured":"Lv D, Zhu S. Achieving correlated differential privacy of big data publication. Computers & Security, 2019, 82: 184\u2013195. DOI: https:\/\/doi.org\/10.1016\/j.cose.2018.12.017.","journal-title":"Computers & Security"},{"key":"2635_CR37","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jpdc.2019.10.009","volume":"136","author":"T Wang","year":"2020","unstructured":"Wang T, Mei Y, Jia W, Zheng X, Wang G, Xie M. Edge-based differential privacy computing for sensor-cloud systems. Journal of Parallel and Distributed Computing, 2020, 136: 75\u201385. DOI: https:\/\/doi.org\/10.1016\/j.jpdc.2019.10.009.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"2635_CR38","doi-asserted-by":"publisher","first-page":"3454","DOI":"10.1109\/TIFS.2020.2988575","volume":"15","author":"K Wei","year":"2020","unstructured":"Wei K, Li J, Ding M, Ma C, Yang H H, Farokhi F, Jin S, Quek T Q S, Poor H V. Federated learning with differential privacy: Algorithms and performance analysis. IEEE Trans. Information Forensics and Security, 2020, 15: 3454\u20133469. DOI: https:\/\/doi.org\/10.1109\/TIFS.2020.2988575.","journal-title":"IEEE Trans. Information Forensics and Security"},{"issue":"10","key":"2635_CR39","doi-asserted-by":"publisher","first-page":"10477","DOI":"10.1109\/TVT.2021.3108463","volume":"70","author":"T Bao","year":"2021","unstructured":"Bao T, Xu L, Zhu L, Wang L, Li T. Successive point-of-interest recommendation with personalized local differential privacy. IEEE Trans. Vehicular Technology, 2021, 70(10): 10477\u201310488. DOI: https:\/\/doi.org\/10.1109\/TVT.2021.3108463.","journal-title":"IEEE Trans. Vehicular Technology"},{"issue":"3\/4","key":"2635_CR40","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork C, Roth A. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, 2014, 9(3\/4): 211\u2013407. DOI: https:\/\/doi.org\/10.1561\/0400000042.","journal-title":"Foundations and Trends\u00ae in Theoretical Computer Science"},{"key":"2635_CR41","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1559845.1559850","volume-title":"Proc. the 2009 ACM SIGMOD International Conference on Management of Data","author":"F D McSherry","year":"2009","unstructured":"McSherry F D. Privacy integrated queries: An extensible platform for privacy-preserving data analysis. In Proc. the 2009 ACM SIGMOD International Conference on Management of Data, Jun. 2009, pp.19\u201330. DOI: https:\/\/doi.org\/10.1145\/1559845.1559850."},{"issue":"1","key":"2635_CR42","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin R. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 1992, 17(1): 36\u201342. DOI: https:\/\/doi.org\/10.1287\/moor.17.1.36.","journal-title":"Mathematics of Operations Research"},{"issue":"11","key":"2635_CR43","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J Y Yen","year":"1971","unstructured":"Yen J Y. Finding the K shortest loopless paths in a network. Management Science, 1971, 17(11): 712\u2013716. DOI: https:\/\/doi.org\/10.1287\/mnsc.17.11.712.","journal-title":"Management Science"},{"issue":"3","key":"2635_CR44","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/TNET.2007.900712","volume":"16","author":"G Xue","year":"2008","unstructured":"Xue G, Zhang W, Tang J, Thulasiraman K. Polynomial time approximation algorithms for multi-constrained QoS routing. IEEE\/ACM Trans. Networking, 2008, 16(3): 656\u2013669. DOI: https:\/\/doi.org\/10.1109\/TNET.2007.900712.","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"2635_CR45","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1145\/2488388.2488490","volume-title":"Proc. the 22nd International Conference on World Wide Web","author":"A Singla","year":"2013","unstructured":"Singla A, Krause A. Truthful incentives in crowdsourcing tasks using regret minimization mechanisms. In Proc. the 22nd International Conference on World Wide Web, May 2013, pp.1167\u20131178. DOI: https:\/\/doi.org\/10.1145\/2488388.2488490."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-024-2635-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-024-2635-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-024-2635-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:54:18Z","timestamp":1737006858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-024-2635-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":45,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2635"],"URL":"https:\/\/doi.org\/10.1007\/s11390-024-2635-5","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]},"assertion":[{"value":"4 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Conflict of Interest The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}]}}