{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:47:23Z","timestamp":1743148043993,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030140939"},{"type":"electronic","value":"9783030140946"}],"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-14094-6_4","type":"book-chapter","created":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T08:58:51Z","timestamp":1550134731000},"page":"47-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Maximum Connectivity Improvement Problem"],"prefix":"10.1007","author":[{"given":"Federico","family":"Cor\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina M.","family":"Pinotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,15]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/15326340600649052","volume":"22","author":"K Avrachenkov","year":"2006","unstructured":"Avrachenkov, K., Litvak, N.: The effect of new links on Google PageRank. Stoc. Models 22(2), 319\u2013331 (2006)","journal-title":"Stoc. Models"},{"key":"4_CR2","unstructured":"Cordasco, G., et al.: Whom to befriend to influence people. CoRR abs\/1611.08687 (2016). \n                    http:\/\/arxiv.org\/abs\/1611.08687"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-20086-6_4","volume-title":"Experimental Algorithms","author":"P Crescenzi","year":"2015","unstructured":"Crescenzi, P., D\u2019Angelo, G., Severini, L., Velaj, Y.: Greedily improving our own centrality in a network. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 43\u201355. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-20086-6_4"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2953882","volume":"11","author":"P Crescenzi","year":"2016","unstructured":"Crescenzi, P., D\u2019Angelo, G., Severini, L., Velaj, Y.: Greedily improving our own closeness centrality in a network. TKDD 11(1), 9:1\u20139:32 (2016)","journal-title":"TKDD"},{"key":"4_CR5","unstructured":"D\u2019Angelo, G., Severini, L., Velaj, Y.: Selecting nodes and buying links to maximize the information diffusion in a network. In: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, LIPIcs, vol. 83, pp. 75:1\u201375:14 (2017)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13731-0_39","volume-title":"Algorithm Theory","author":"ED Demaine","year":"2010","unstructured":"Demaine, E.D., Zadimoghaddam, M.: Minimizing the diameter of a network using shortcut edges. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 420\u2013431. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-13731-0_39"},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"KP Eswaran","year":"1976","unstructured":"Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5(4), 653\u2013665 (1976)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"4_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Ishakian, V., Erd\u00f6s, D., Terzi, E., Bestavros, A.: A framework for the evaluation and management of network centrality. In: Proceedings of the 12th SIAM International Conference on Data Mining (SDM), pp. 427\u2013438. SIAM (2012)","DOI":"10.1137\/1.9781611972825.37"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-03685-9_21","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A Meyerson","year":"2009","unstructured":"Meyerson, A., Tagiku, B.: Minimizing average shortest path distances via shortcut edge addition. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX\/RANDOM -2009. LNCS, vol. 5687, pp. 272\u2013285. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-03685-9_21"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-i. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2013.08.003","volume":"518","author":"M Olsen","year":"2014","unstructured":"Olsen, M., Viglas, A.: On the approximability of the link building problem. Theor. Comput. Sci. 518, 96\u2013116 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"4_CR14","first-page":"12","volume":"10","author":"M Papagelis","year":"2015","unstructured":"Papagelis, M.: Refining social graph connectivity via shortcut edge addition. ACM Trans. Knowl. Discovery Data (TKDD) 10(2), 12 (2015)","journal-title":"ACM Trans. Knowl. Discovery Data (TKDD)"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A Tamir","year":"1996","unstructured":"Tamir, A.: An o\n                    \n                      \n                    \n                    $$(pn^2)$$\n                  . algorithm for the p-median and related problems on tree graphs. Oper. Res. Lett. 19(2), 59\u201364 (1996)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14094-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T07:36:13Z","timestamp":1558337773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-14094-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140939","9783030140946"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14094-6_4","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":"15 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2018","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":"algosensors2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/algosensors\/cfp\/","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"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"39","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"38% - 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"}},{"value":"2.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}