{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:22:52Z","timestamp":1742959372618,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030615260"},{"type":"electronic","value":"9783030615277"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61527-7_28","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T18:04:39Z","timestamp":1602698679000},"page":"421-436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing Network Coverage Under the Presence of Time Constraint by Injecting Most Effective k-Links"],"prefix":"10.1007","author":[{"given":"Kouzou","family":"Ohara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayasu","family":"Fushimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazumi","family":"Saito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Kimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,15]]},"reference":[{"issue":"7","key":"28_CR1","doi-asserted-by":"publisher","first-page":"8786","DOI":"10.3390\/s130708786","volume":"13","author":"VK Akram","year":"2013","unstructured":"Akram, V.K., Dagdeviren, O.: Breadth-first search-based single-phase algorithms for bridge detection in wireless sensor networks. Sensors 13(7), 8786\u20138813 (2013)","journal-title":"Sensors"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: In-core computation of geometric centralities with hyperball: a hunderd billion nodes and beyond. In: Proceedings of the 2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW 2013), pp. 621\u2013628 (2013)","DOI":"10.1109\/ICDMW.2013.10"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b106453","volume-title":"Network Analysis","year":"2005","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol. 3418. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/b106453"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30, 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"issue":"4","key":"28_CR5","first-page":"298","volume":"4","author":"K Burckhart","year":"2012","unstructured":"Burckhart, K., Martin, O.J.: An interpretation of the recent evolution of the city of Barcelona through the traffic maps. J. Geogr. Inf. Syst. 4(4), 298\u2013311 (2012)","journal-title":"J. Geogr. Inf. Syst."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/2.781636","volume":"32","author":"S Chakrabarti","year":"1999","unstructured":"Chakrabarti, S., et al.: Mining the web\u2019s link structure. IEEE Comput. 32, 60\u201367 (1999)","journal-title":"IEEE Comput."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Chaoji, V., Ranu, S., Rastogi, R., Bhatt, R.: Recommendations to boost content spread in social networks. In: Proceedings of the 21th International Conference on World Wide Web (WWW 2012), pp. 529\u2013538 (2012)","DOI":"10.1145\/2187836.2187908"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Epasto, A., Kumar, R., Lattanzi, S., Mirrokni, V.: Efficient algorithms for public-private social networks. In: Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2015), pp. 139\u2013148 (2015)","DOI":"10.1145\/2783258.2783354"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, E.: All-distances sketches, revisited: hip estimators for massive graphs analysis. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 88\u201399 (2014)","DOI":"10.1145\/2594538.2594546"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Crescenzi, P., D\u2019angelo, G., Severini, L., Velaj, Y.: Greedily improving our own closeness centrality in a network. ACM Trans. Knowl. Discov. Data 11(1), 1\u201332 (2016)","DOI":"10.1145\/2953882"},{"issue":"3","key":"28_CR11","doi-asserted-by":"publisher","first-page":"036125","DOI":"10.1103\/PhysRevE.73.036125","volume":"73","author":"P Crucitti","year":"2006","unstructured":"Crucitti, P., Latora, V., Porta, S.: Centrality measures in spatial networks of urban streets. Phys. Rev. E 73(3), 036125 (2006)","journal-title":"Phys. Rev. E"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1017\/CBO9780511811395.004","volume-title":"Models and Methods in Social Network Analysis","author":"MG Everett","year":"2005","unstructured":"Everett, M.G., Borgatti, S.P.: Extending centrality. In: Carrington, P.J., Scott, J., Wasserman, S. (eds.) Models and Methods in Social Network Analysis, pp. 57\u201376. Cambridge University Press, New York (2005)"},{"key":"28_CR13","first-page":"1","volume":"99","author":"YP Fang","year":"2014","unstructured":"Fang, Y.P., Pedroni, N., Zio, E.: Comparing network-centric and power flow models for the optimal allocation of link capacities in a cascade-resilient power transmission network. IEEE Syst. J. 99, 1\u201312 (2014)","journal-title":"IEEE Syst. J."},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L Freeman","year":"1979","unstructured":"Freeman, L.: Centrality in social networks: conceptual clarification. Soc. Netw. 1, 215\u2013239 (1979)","journal-title":"Soc. Netw."},{"issue":"864","key":"28_CR15","first-page":"1","volume":"3","author":"D Grady","year":"2012","unstructured":"Grady, D., Thiemann, C., Brockmann, D.: Robust classification of salient links in complex networks. Nature Commun. 3(864), 1\u201310 (2012)","journal-title":"Nature Commun."},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/1514888.1514892","volume":"3","author":"M Kimura","year":"2009","unstructured":"Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Discov. Data 3, 9:1\u20139:23 (2009)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s41060-015-0001-y","volume":"1","author":"M Kimura","year":"2015","unstructured":"Kimura, M., Saito, K., Ohara, K., Motoda, H.: Speeding-up node influence computation for huge social networks. Int. J. Data Sci. Anal. 1(1), 3\u201316 (2015). https:\/\/doi.org\/10.1007\/s41060-015-0001-y","journal-title":"Int. J. Data Sci. Anal."},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-31955-9_3","volume-title":"Network Analysis","author":"D Kosch\u00fctzki","year":"2005","unstructured":"Kosch\u00fctzki, D., et al.: Centrality indices. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 16\u201361. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31955-9_3"},{"issue":"5","key":"28_CR19","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1068\/b32128","volume":"34","author":"DA Montis","year":"2007","unstructured":"Montis, D.A., Barthelemy, M., Chessa, A., Vespignani, A.: The structure of interurban traffic: a weighted network analysis. Environ. Plan. 34(5), 905\u2013924 (2007)","journal-title":"Environ. Plan."},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M Newman","year":"2003","unstructured":"Newman, M.: The structure and function of complex networks. SIAM Rev. 45, 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-46307-0_24","volume-title":"Discovery Science","author":"K Ohara","year":"2016","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Accelerating computation of distance based centrality measures for spatial networks. In: Calders, T., Ceci, M., Malerba, D. (eds.) DS 2016. LNCS (LNAI), vol. 9956, pp. 376\u2013391. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46307-0_24"},{"key":"28_CR22","doi-asserted-by":"publisher","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Maximizing network performance based on group centrality by creating most effective $$k$$-links. In: Proceedings of the 4th IEEE Data Science and Advanced Analytics (DSAA2017), pp. 561\u2013570. IEEE Explore (2017). https:\/\/doi.org\/10.1109\/DSAA.2017.44","DOI":"10.1109\/DSAA.2017.44"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.sbspro.2014.12.196","volume":"162","author":"EL Oliveira","year":"2014","unstructured":"Oliveira, E.L., Portugal, L.S., Junior, W.P.: Determining critical links in a road network: vulnerability and congestion indicators. Proc. Soc. Behav. Sci. 162, 158\u2013167 (2014)","journal-title":"Proc. Soc. Behav. Sci."},{"issue":"3","key":"28_CR24","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","volume":"32","author":"T Opsahl","year":"2010","unstructured":"Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: generalizing degree and shortest paths. Soc. Netw. 32(3), 245\u2013251 (2010)","journal-title":"Soc. Netw."},{"issue":"2","key":"28_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2757281","volume":"10","author":"M Papagelis","year":"2015","unstructured":"Papagelis, M.: Refining social graph connectivity via shortcut edge addition. ACM Trans. Knowl. Discov. Data 10(2), 1\u201335 (2015)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"28_CR26","unstructured":"Park, K., Yilmaz, A.: A social network analysis approach to analyze road networks. In: Proceedings of the ASPRS Annual Conference 2010 (2010)"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Parotsidis, N., Pitoura, E., Tsaparas, P.: Selecting shortcuts for a smaller world. In: Proceedings of the 2015 SIAM International Conference on Data Mining (SDM 2015), pp. 28\u201336 (2015)","DOI":"10.1137\/1.9781611974010.4"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Parotsidis, N., Pitoura, E., Tsaparas, P.: Centrality-aware link recommendations. In: Proceedings of of the Ninth ACM International Conference on Web Search and Data Mining (WSDM 2016), pp. 503\u2013512 (2016)","DOI":"10.1145\/2835776.2835818"},{"issue":"2","key":"28_CR29","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10844-018-0523-6","volume":"51","author":"K Saito","year":"2018","unstructured":"Saito, K., Ohara, K., Kimura, M., Motoda, H.: Accurate and efficient detection of critical links in network to minimize information loss. J. Intell. Inf. Syst. 51(2), 235\u2013255 (2018). https:\/\/doi.org\/10.1007\/s10844-018-0523-6","journal-title":"J. Intell. Inf. Syst."},{"key":"28_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-97304-3_22","volume-title":"PRICAI 2018: Trends in Artificial Intelligence","author":"K Saito","year":"2018","unstructured":"Saito, K., Ohara, K., Kimura, M., Motoda, H.: Efficient detection of critical links to maintain performance of network with uncertain connectivity. In: Geng, X., Kang, B.-H. (eds.) PRICAI 2018. LNCS (LNAI), vol. 11012, pp. 282\u2013295. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97304-3_22"},{"key":"28_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-29911-8_31","volume-title":"PRICAI 2019: Trends in Artificial Intelligence","author":"K Saito","year":"2019","unstructured":"Saito, K., Ohara, K., Kimura, M., Motoda, H.: Efficient identification of critical links based on reachability under the presence of time constraint. In: Nayak, A.C., Sharma, A. (eds.) PRICAI 2019. LNCS (LNAI), vol. 11671, pp. 404\u2013418. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29911-8_31"},{"issue":"3","key":"28_CR32","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/TNET.2012.2215882","volume":"21","author":"Y Shen","year":"2013","unstructured":"Shen, Y., Nguyen, N.P., Xuan, Y., Thai, M.T.: On the discovery of critical links and nodes for assessing network vulnerability. IEEE\/ACM Trans. Netw. 21(3), 963\u2013973 (2013)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"28_CR33","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/MNET.2011.5687952","volume":"25","author":"I Stojmenovic","year":"2011","unstructured":"Stojmenovic, I., Simplot-Ryl, D., Nayak, A., Velaj, Y.: Toward scalable cutvertex and link detection with applications in wireless ad hoc networks. IEEE Netw. 25(1), 44\u201348 (2011)","journal-title":"IEEE Netw."},{"key":"28_CR34","doi-asserted-by":"crossref","unstructured":"Tong, H., Prakash, B.A., Eliassi-Rad, T., Faloutsos, M., Faloutsos, C.: Gelling, and melting, large graphs by edge manipulation. In: Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM 2012), pp. 245\u2013254 (2012)","DOI":"10.1145\/2396761.2396795"},{"key":"28_CR35","first-page":"1001:1","volume":"2","author":"P Wang","year":"2012","unstructured":"Wang, P., Hunter, T., Bayen, A.M., Schechtner, K., Gonzalez, M.C.: Understanding road usage patterns in urban areas. Sci. Rep. 2, 1001:1\u20131001:6 (2012)","journal-title":"Sci. Rep."}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61527-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:52:03Z","timestamp":1709812323000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-61527-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030615260","9783030615277"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61527-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discovery Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dis2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ds2020.csd.auth.gr\/","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":"76","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":"26","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":"19","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":"34% - 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":"4","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)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}