{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:52:45Z","timestamp":1743137565390,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030235963"},{"type":"electronic","value":"9783030235970"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23597-0_43","type":"book-chapter","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T11:03:48Z","timestamp":1561028628000},"page":"533-544","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Trajectory Comparison in a Vehicular Network I: Computing a Consensus Trajectory"],"prefix":"10.1007","author":[{"given":"Peng","family":"Zou","sequence":"first","affiliation":[]},{"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":[[2019,6,21]]},"reference":[{"issue":"1","key":"43_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.7155\/jgaa.00175","volume":"13","author":"S Angibaud","year":"2009","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Thevenin, A., Vialette, S.: On the approximability of comparing genomes with duplicates. J. Graph Algorithms Appl. 13(1), 19\u201353 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"43_CR2","unstructured":"Bryant, D.: The complexity of the breakpoint median problem. Technical report CRM-2579. Centre de Recherches en Math\u00e9matiques, Universit\u00e9 de Montr\u00e9al (1998)"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Doucer, J.: The sybil attack. In: Proceedings of IPTPS 2001 Revised Papers from the First International Workshop on Peer-to-Peer Systems, pp. 251\u2013260 (2002)","DOI":"10.1007\/3-540-45748-8_24"},{"key":"43_CR4","unstructured":"Edmonds, J., Johnson, E.: Matching: a well-solved class of integer linear programs. In: Combinatorial Structures and Their Applications, Gordon and Breach, New York, pp. 89\u201392 (1969)"},{"key":"43_CR5","volume-title":"VANET: Vehicular Applications and Inter-networking Technologies","author":"H Hartenstein","year":"2009","unstructured":"Hartenstein, H., Kenneth, L.: VANET: Vehicular Applications and Inter-networking Technologies. Wiley, Hoboken (2009)"},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-21458-5_7","volume-title":"Combinatorial Pattern Matching","author":"H Jiang","year":"2011","unstructured":"Jiang, H., Zhong, F., Zhu, B.: Filling scaffolds with gene repetitions: maximizing the number of adjacencies. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 55\u201364. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-21458-5_7"},{"issue":"4","key":"43_CR7","doi-asserted-by":"crossref","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.: Scaffold filling under the breakpoint and related distances. IEEE\/ACM Trans. Comput. Biol. Bioinform. 9(4), 1220\u20131229 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Liu, G., Yang, Q., Wang, H., Lin, X., Wittie, M.: Assessment of multi-hop interpersonal trust in social networks by three-valued subjective logic. In: Proceedings of INFOCOM 2014, pp. 1698\u20131706 (2014)","DOI":"10.1109\/INFOCOM.2014.6848107"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Liu, G., Chen, Q., Yang, Q., Zhu, B., Wang, H., Wang, W.: OpinionWalk: an efficient solution to massive trust assessment in online social networks. In: Proceedings of INFOCOM 2017, pp. 1\u20139 (2017)","DOI":"10.1109\/INFOCOM.2017.8057106"},{"issue":"1","key":"43_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/jcss.2002.1823","volume":"65","author":"M Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: Finding similar regions in many sequences. J. Comput. Sys. Sci. 65(1), 73\u201396 (2002)","journal-title":"J. Comput. Sys. Sci."},{"issue":"11","key":"43_CR11","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/MCOM.2008.4689252","volume":"46","author":"P Papadimitratos","year":"2008","unstructured":"Papadimitratos, P., et al.: Secure vehicular communication systems: design and architecture. IEEE Commun. Mag. 46(11), 100\u2013109 (2008)","journal-title":"IEEE Commun. Mag."},{"key":"43_CR12","unstructured":"Pe\u2019er, I., Shamir, R.: The median problems for breakpoints are NP-complete. Elec. Colloq. Comput. Complex. TR-98-071 (1998)"},{"issue":"2","key":"43_CR13","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(81)90009-0","volume":"12","author":"Y Shiloach","year":"1981","unstructured":"Shiloach, Y.: Another look at the degree constrained subgraph problem. Inf. Process. Lett. 12(2), 89\u201392 (1981)","journal-title":"Inf. Process. Lett."},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Shrestha, R., Djuraev, S., Nam, S.Y.: Sybil attack detection in vehicular network based on received signal strength. In: Proceedings of 3rd International Conference on Connected Vehicles and Expo (ICCVE 2014), pp. 745\u2013746 (2014)","DOI":"10.1109\/ICCVE.2014.7297649"},{"key":"43_CR15","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1186\/1471-2105-10-120","volume":"10","author":"E Tannier","year":"2009","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinform. 10, 120 (2009)","journal-title":"BMC Bioinform."},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, J.: A survey on trust management for VANETS. In: Proceedings of 2011 IEEE International Conference on Advanced Information Networking and Applications (AINA 2011), pp. 105\u2013115 (2011)","DOI":"10.1109\/AINA.2011.86"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23597-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T05:15:14Z","timestamp":1561612514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-23597-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030235963","9783030235970"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23597-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Algorithms, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Honolulu, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2019\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"143","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}