{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T12:49:29Z","timestamp":1749818969778},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319317526"},{"type":"electronic","value":"9783319317533"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-31753-3_33","type":"book-chapter","created":{"date-parts":[[2016,4,11]],"date-time":"2016-04-11T13:06:43Z","timestamp":1460380003000},"page":"409-422","source":"Crossref","is-referenced-by-count":3,"title":["Discovering the Network Backbone from Traffic Activity Data"],"prefix":"10.1007","author":[{"given":"Sanjay","family":"Chawla","sequence":"first","affiliation":[]},{"given":"Kiran","family":"Garimella","sequence":"additional","affiliation":[]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[]},{"given":"Dominic","family":"Tsang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,12]]},"reference":[{"key":"33_CR1","unstructured":"Boldi, P., Vigna, S.: Axioms for centrality (2013). CoRR abs\/1308.2140"},{"issue":"3","key":"33_CR2","first-page":"321","volume":"27","author":"F Bonchi","year":"2013","unstructured":"Bonchi, F., De Francisci Morales, G., Gionis, A., Ukkonen, A.: Activity preserving graph simplification. DMKD 27(3), 321\u2013343 (2013)","journal-title":"DMKD"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Du, N., Wu, B., Wang, B.: Backbone discovery in social networks. In: Web Intelligence (2007)","DOI":"10.1109\/WI.2007.36"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-13036-6_6","volume-title":"Integer Programming and Combinatorial Optimization","author":"MT Hajiaghayi","year":"2010","unstructured":"Hajiaghayi, M.T., Khandekar, R., Kortsarz, G., Nutov, Z.: Prize-collecting steiner network problems. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 71\u201384. Springer, Heidelberg (2010)"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0378-4371(00)00311-3","volume":"285","author":"M Marchiori","year":"2000","unstructured":"Marchiori, M., Latora, V.: Harmony in the small world. Physica A 285, 539 (2000)","journal-title":"Physica A"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Mathioudakis, M., Bonchi, F., Castillo, C., Gionis, A., Ukkonen, A.: Sparsification of influence networks. In: KDD (2011)","DOI":"10.1145\/2020408.2020492"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ipl.2005.11.002","volume":"97","author":"E Misiolek","year":"2006","unstructured":"Misiolek, E., Chen, D.Z.: Two flow network simplification algorithms. IPL 97, 197\u2013202 (2006)","journal-title":"IPL"},{"key":"33_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: CIKM (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"33_CR10","unstructured":"Ruan, N., Jin, R., Wang, G., Huang, K.: Network backbone discovery using edge clustering (2012). arxiv:1202.1842"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-13062-5_21","volume-title":"Advances in Intelligent Data Analysis IX","author":"H Toivonen","year":"2010","unstructured":"Toivonen, H., Mahler, S., Zhou, F.: A framework for path-oriented network simplification. In: Cohen, P.R., Adams, N.M., Berthold, M.R. (eds.) IDA 2010. LNCS, vol. 6065, pp. 220\u2013231. Springer, Heidelberg (2010)"},{"key":"33_CR12","unstructured":"West, R., Pineau, J., Precup, D.: Wikispeedia: an online game for inferring semantic distances between concepts. In: IJCAI, pp. 1598\u20131603 (2009)"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Williamson, D., Shmoys, D.: The design of approximation algorithms. In: CUP (2011)","DOI":"10.1017\/CBO9780511921735"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Zhou, F., Mahler, S., Toivonen, H.: Network simplification with minimal loss of connectivity. In: IDA (2010)","DOI":"10.1109\/ICDM.2010.133"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31753-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T16:16:02Z","timestamp":1655482562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31753-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319317526","9783319317533"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31753-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}