{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:27Z","timestamp":1740122427774,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T00:00:00Z","timestamp":1663977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T00:00:00Z","timestamp":1663977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1761641"],"award-info":[{"award-number":["CNS-1761641"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61628207"],"award-info":[{"award-number":["61628207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10878-022-00909-3","type":"journal-article","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T02:02:19Z","timestamp":1663984939000},"page":"3575-3594","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing a consensus trajectory in a vehicular network"],"prefix":"10.1007","volume":"44","author":[{"given":"Peng","family":"Zou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9745-9584","authenticated-orcid":false,"given":"Letu","family":"Qingge","sequence":"additional","affiliation":[]},{"given":"Qing","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,24]]},"reference":[{"issue":"1","key":"909_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7155\/jgaa.00175","volume":"13","author":"S Angibaud","year":"2009","unstructured":"Angibaud S, Fertin G, Rusu I, Th\u00e9venin A, Vialette S (2009) On the approximability of comparing genomes with duplicates. J Graph Algorithms Appl 13(1):19\u201353","journal-title":"J Graph Algorithms Appl"},{"unstructured":"Bryant D (1998) The complexity of the breakpoint median problem technical report crm-2579. Universit\u00e9 de Montr\u00e9al, Centre de recherches math\u00e9matiques","key":"909_CR2"},{"doi-asserted-by":"crossref","unstructured":"Douceur JR (2002) The sybil attack. In: Peer-to-Peer Systems, First International Workshop. IPTPS 2002, Revised Papers 2429:251\u2013260","key":"909_CR3","DOI":"10.1007\/3-540-45748-8_24"},{"key":"909_CR4","first-page":"27","volume":"2570","author":"JR Edmonds","year":"2001","unstructured":"Edmonds JR, Johnson EL (2001) Matching: a well-solved class of integer linear programs. Comb Struct Appl 2570:27\u201330","journal-title":"Comb Struct Appl"},{"key":"909_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/9780470740637","volume-title":"VANET: vehicular applications and inter-networking technologies","author":"H Hartenstein","year":"2010","unstructured":"Hartenstein H, Laberteaux KP (2010) VANET: vehicular applications and inter-networking technologies. Wiley, Hoboken"},{"issue":"4","key":"909_CR6","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1109\/TCBB.2012.57","volume":"9","author":"H Jiang","year":"2012","unstructured":"Jiang H, Zheng C, Sankoff D, Zhu B (2012) Scaffold filling under the breakpoint and related distances. IEEE ACM Trans Comput Biol Bioinform 9(4):1220\u20131229","journal-title":"IEEE ACM Trans Comput Biol Bioinform"},{"doi-asserted-by":"crossref","unstructured":"Jiang H, Zhong F, Zhu B (2011) Filling scaffolds with gene repetitions: maximizing the number of adjacencies. In: Combinatorial pattern matching - 22nd annual symposium, CPM 2011, Proceedings 6661:55\u201364","key":"909_CR7","DOI":"10.1007\/978-3-642-21458-5_7"},{"issue":"2","key":"909_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0065","volume":"38","author":"BY Kara","year":"2004","unstructured":"Kara BY, Verter V (2004) Designing a road network for hazardous materials transportation. Transp Sci 38(2):188\u2013196","journal-title":"Transp Sci"},{"doi-asserted-by":"crossref","unstructured":"Kchaou A, Abassi R, Fatmi SGE (2018) Toward a distributed trust management scheme for VANET. In: Proceedings of the 13th international conference on availability, reliability and security 53:1\u20136","key":"909_CR9","DOI":"10.1145\/3230833.3232824"},{"issue":"1","key":"909_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jcss.2002.1823","volume":"65","author":"M Li","year":"2002","unstructured":"Li M, Ma B, Wang L (2002) Finding similar regions in many sequences. J Comput Syst Sci 65(1):73\u201396","journal-title":"J Comput Syst Sci"},{"doi-asserted-by":"crossref","unstructured":"Liu G, Chen Q, Yang Q, Zhu B, Wang H, Wang W (2017) Opinionwalk: An efficient solution to massive trust assessment in online social networks. In IEEE conference on computer communications, INFOCOM 17:1\u20139","key":"909_CR11","DOI":"10.1109\/INFOCOM.2017.8057106"},{"doi-asserted-by":"crossref","unstructured":"Liu G, Yang Q, Wang H, Lin X, Wittie MP (2014) Assessment of multi-hop interpersonal trust in social networks by three-valued subjective logic. In: IEEE Conference on computer communications, INFOCOM 14:1698\u20131706","key":"909_CR12","DOI":"10.1109\/INFOCOM.2014.6848107"},{"issue":"11","key":"909_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/MCOM.2008.4689252","volume":"46","author":"P Papadimitratos","year":"2008","unstructured":"Papadimitratos P, Butty\u00e1n L, Holczer T, Schoch E, Freudiger J, Raya M, Ma Z, Kargl F, Kung A, Hubaux J (2008) Secure vehicular communication systems: design and architecture. IEEE Commun Mag 46(11):100\u2013109","journal-title":"IEEE Commun Mag"},{"key":"909_CR14","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.procs.2015.03.112","volume":"45","author":"NJ Patel","year":"2015","unstructured":"Patel NJ, Jhaveri RH (2015) Trust based approaches for secure routing in vanet: a survey. Procedia Comput Sci 45:592\u2013601","journal-title":"Procedia Comput Sci"},{"unstructured":"Pe\u2019er I,Shamir R (1998) The median problems for breakpoints are np-complete. Electron Colloquium Comput Complex. 5(71)","key":"909_CR15"},{"doi-asserted-by":"crossref","unstructured":"Qingge L, Zou P, Dai L, Yang Q, Zhu B (2019) Trajectory comparison in a vehicular network II: eliminating the redundancy. In: Wireless algorithms, systems, and applications\u201414th International Conference, WASA 2019 11604:260\u2013271","key":"909_CR16","DOI":"10.1007\/978-3-030-23597-0_21"},{"key":"909_CR17","doi-asserted-by":"publisher","first-page":"34415","DOI":"10.1109\/ACCESS.2021.3061501","volume":"9","author":"L Qingge","year":"2021","unstructured":"Qingge L, Zou P, Dai L, Yang Q, Zhu B (2021) On comparing the similarity and dissimilarity between two distinct vehicular trajectories. IEEE Access 9:34415\u201334422","journal-title":"IEEE Access"},{"issue":"2","key":"909_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0020-0190(81)90009-0","volume":"12","author":"Y Shiloach","year":"1981","unstructured":"Shiloach Y (1981) Another look at the degree constrained subgraph problem. Inf Process Lett 12(2):89\u201392","journal-title":"Inf Process Lett"},{"doi-asserted-by":"crossref","unstructured":"Shrestha R, Djuraev S, Nam SY (2014) Sybil attack detection in vehicular network based on received signal strength. In: International conference on connected vehicles and expo. 2014:745\u2013746","key":"909_CR19","DOI":"10.1109\/ICCVE.2014.7297649"},{"key":"909_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-10-120","volume":"10","author":"E Tannier","year":"2009","unstructured":"Tannier E, Zheng C, Sankoff D (2009) Multichromosomal median and halving problems under different genomic distances. BMC Bioinform 10:1","journal-title":"BMC Bioinform"},{"issue":"2","key":"909_CR21","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/s10878-014-9751-z","volume":"30","author":"C Xin","year":"2015","unstructured":"Xin C, Qingge L, Wang J, Zhu B (2015) Robust optimization for the hazardous materials transportation network design problem. J Comb Optim 30(2):320\u2013334","journal-title":"J Comb Optim"},{"doi-asserted-by":"crossref","unstructured":"Zhang, J. (2011). A survey on trust management for vanets. In: 25th IEEE international conference on advanced information networking and applications, AINA 2011, pages 105\u2013112. IEEE Computer Society","key":"909_CR22","DOI":"10.1109\/AINA.2011.86"},{"doi-asserted-by":"crossref","unstructured":"Zou P, Qingge L, Yang Q, Zhu B (2019) Trajectory comparison in a vehicular network I: computing a consensus trajectory. In: Wireless algorithms, systems, and applications\u201414th international conference, WASA 2019 11604:533\u2013544","key":"909_CR23","DOI":"10.1007\/978-3-030-23597-0_43"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00909-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00909-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00909-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T09:40:09Z","timestamp":1667036409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00909-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,24]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["909"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00909-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,9,24]]},"assertion":[{"value":"15 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}