{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:51:24Z","timestamp":1725864684346},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319457376"},{"type":"electronic","value":"9783319457383"}],"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-45738-3_5","type":"book-chapter","created":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T07:49:06Z","timestamp":1473752946000},"page":"68-84","source":"Crossref","is-referenced-by-count":4,"title":["Distance-Constrained k Spatial Sub-Networks: A Summary of Results"],"prefix":"10.1007","author":[{"given":"KwangSoo","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,14]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s00453-001-0110-y","volume":"33","author":"PK Agarwal","year":"2002","unstructured":"Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. Algorithmica 33(2), 201\u2013226 (2002)","journal-title":"Algorithmica"},{"key":"5_CR2","doi-asserted-by":"crossref","DOI":"10.1201\/b15410","volume-title":"Data Clustering: Algorithms and Applications","author":"CC Aggarwal","year":"2013","unstructured":"Aggarwal, C.C., et al.: Data Clustering: Algorithms and Applications. CRC Press, Boca Raton (2013)"},{"key":"5_CR3","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J., Weihe, K.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"issue":"1","key":"5_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2010.11.002","volume":"499","author":"M Barth\u00e9lemy","year":"2011","unstructured":"Barth\u00e9lemy, M.: Spatial networks. Phys. Rep. 499(1), 1\u2013101 (2011)","journal-title":"Phys. Rep."},{"issue":"1","key":"5_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0966-6923(97)00037-9","volume":"6","author":"WR Black","year":"1998","unstructured":"Black, W.R., Thomas, I.: Accidents on Belgium\u2019s motorways: a network autocorrelation analysis. J. Transp. Geogr. 6(1), 23\u201331 (1998)","journal-title":"J. Transp. Geogr."},{"key":"5_CR6","series-title":"Lecture Notes in Geoinformation and Cartography","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-3-642-00318-9_11","volume-title":"Advances in GIScience","author":"K Buchin","year":"2009","unstructured":"Buchin, K., et al.: Detecting hotspots in geographic networks. In: Sester, M., Bernard, L., Paelke, V. (eds.) Advances in GIScience. LNGC, pp. 217\u2013231. Springer, Berlin (2009)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1007\/978-3-540-77120-3_56","volume-title":"Algorithms and Computation","author":"P Carmi","year":"2007","unstructured":"Carmi, P., Katz, M.J., Lev-Tov, N.: Covering points by unit disks of fixed location. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 644\u2013655. Springer, Heidelberg (2007)"},{"issue":"1\u20132","key":"5_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02238188","volume":"36","author":"BM Chazelle","year":"1986","unstructured":"Chazelle, B.M., et al.: On a circle placement problem. Computing 36(1\u20132), 1\u201316 (1986)","journal-title":"Computing"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Z., et al.: Discovering popular routes from trajectories. In: 2011 IEEE 27th International Conference on Data Engineering, pp. 900\u2013911. IEEE (2011)","DOI":"10.1109\/ICDE.2011.5767890"},{"issue":"4","key":"5_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10109-008-0068-2","volume":"10","author":"Y Chun","year":"2008","unstructured":"Chun, Y.: Modeling network autocorrelation within migration flows by eigenvector spatial filtering. J. Geogr. Syst. 10(4), 317\u2013344 (2008)","journal-title":"J. Geogr. Syst."},{"key":"5_CR11","unstructured":"City of Chicago Data Potal, Crimes - 2001 to Present. https:\/\/data.cityofchicago.org\/Public-Safety\/Crimes-2001-to-present\/ijzp-q8t2 . Accessed Dec 2015"},{"issue":"4","key":"5_CR12","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1287\/trsc.28.4.317","volume":"28","author":"J Current","year":"1994","unstructured":"Current, J., Pirkul, H., Rolland, E.: Efficient algorithms for solving the shortest covering path problem. Transp. Sci. 28(4), 317\u2013327 (1994)","journal-title":"Transp. Sci."},{"issue":"2","key":"5_CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1111\/j.1467-9787.1984.tb01030.x","volume":"24","author":"J Current","year":"1984","unstructured":"Current, J., et al.: The shortest covering path problem-an application of locational constraints to network design. J. Reg. Sci. 24(2), 161\u2013183 (1984)","journal-title":"J. Reg. Sci."},{"issue":"1","key":"5_CR14","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)90149-X","volume":"73","author":"JR Current","year":"1994","unstructured":"Current, J.R., Schilling, D.A.: The median tour and maximal covering tour problems: formulations and heuristics. Eur. J. Oper. Res. 73(1), 114\u2013126 (1994)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"5_CR15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0377-2217(85)90030-X","volume":"21","author":"JR Current","year":"1985","unstructured":"Current, J.R., Velle, C.R., Cohon, J.L.: The maximum covering\/shortest path problem: a multiobjective network design and routing formulation. Eur. J. Oper. Res. 21(2), 189\u2013199 (1985)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR16","unstructured":"Downs, J., Horner, M.: Network-based kernel density estimation for home range analysis. In: Proceedings of 9th International Conference on Geocomputation, Maynooth, Ireland (2007)"},{"key":"5_CR17","unstructured":"Ester, M., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, vol. 96, pp. 226\u2013231 (1996)"},{"issue":"2","key":"5_CR18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00224-004-1195-x","volume":"38","author":"D Fotakis","year":"2005","unstructured":"Fotakis, D., et al.: Space efficient hash tables with worst case constant access time. Theor. Comput. Syst. 38(2), 229\u2013248 (2005)","journal-title":"Theor. Comput. Syst."},{"issue":"1","key":"5_CR19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"issue":"3","key":"5_CR20","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s00224-011-9353-4","volume":"50","author":"H Ghasemalizadeh","year":"2012","unstructured":"Ghasemalizadeh, H., Razzazi, M.: An improved approximation algorithm for the most points covering problem. Theor. Comput. Syst. 50(3), 545\u2013558 (2012)","journal-title":"Theor. Comput. Syst."},{"key":"5_CR21","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR22","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2011","unstructured":"Han, J., et al.: Data Mining: Concepts and Techniques. Elsevier, Amsterdam (2011)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Hifi, M., M\u2019hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Adv. Oper. Res. (2009)","DOI":"10.1155\/2009\/150624"},{"issue":"2","key":"5_CR24","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"5_CR25","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"DS Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM (JACM) 33(3), 533\u2013550 (1986)","journal-title":"J. ACM (JACM)"},{"key":"5_CR26","unstructured":"LAPD Crime and Collision Raw Data for 2015. https:\/\/data.lacity.org\/A-Safe-City\/LAPD-Crime-and-Collision-Raw-Data-for-2015\/ttiz-7an8 . Accessed Dec 2015"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/978-3-540-73540-3_25","volume-title":"Advances in Spatial and Temporal Databases","author":"X Li","year":"2007","unstructured":"Li, X., Han, J., Lee, J.-G., Gonzalez, H.: Traffic density-based discovery of hot routes in road networks. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 441\u2013459. Springer, Heidelberg (2007)"},{"issue":"5","key":"5_CR28","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1002\/wics.1217","volume":"4","author":"D Marchette","year":"2012","unstructured":"Marchette, D.: Scan statistics on graphs. Wiley Interdiscip. Rev.: Comput. Stat. 4(5), 466\u2013473 (2012)","journal-title":"Wiley Interdiscip. Rev.: Comput. Stat."},{"issue":"2","key":"5_CR29","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.seps.2008.02.012","volume":"43","author":"L Murawski","year":"2009","unstructured":"Murawski, L., Church, R.L.: Improving accessibility to rural health services: the maximal covering network improvement problem. Soc.-Econ. Plan. Sci. 43(2), 102\u2013110 (2009)","journal-title":"Soc.-Econ. Plan. Sci."},{"key":"5_CR30","doi-asserted-by":"crossref","DOI":"10.1002\/9781119967101","volume-title":"Spatial Analysis Along Networks: Statistical and Computational Methods","author":"A Okabe","year":"2012","unstructured":"Okabe, A., Sugihara, K.: Spatial Analysis Along Networks: Statistical and Computational Methods. Wiley, Hoboken (2012)"},{"issue":"3","key":"5_CR31","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.1538-4632.2001.tb00448.x","volume":"33","author":"A Okabe","year":"2001","unstructured":"Okabe, A., Yamada, I.: The k-function method on a network and its computational implementation. Geogr. Anal. 33(3), 271\u2013290 (2001)","journal-title":"Geogr. Anal."},{"issue":"6","key":"5_CR32","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1109\/TKDE.2013.135","volume":"26","author":"D Oliver","year":"2014","unstructured":"Oliver, D., et al.: A k-main routes approach to spatial network activity summarization. IEEE Trans. Knowl. Data Eng. 26(6), 1464\u20131478 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"5_CR33","unstructured":"OpenStreetMap. http:\/\/www.openstreetmap.org\/ . Accessed Sept 2015"},{"key":"5_CR34","volume-title":"Geographic Information Analysis","author":"D O\u2019Sullivan","year":"2014","unstructured":"O\u2019Sullivan, D., et al.: Geographic Information Analysis. Wiley, Hoboken (2014)"},{"issue":"3","key":"5_CR35","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10588-005-5378-z","volume":"11","author":"CE Priebe","year":"2005","unstructured":"Priebe, C.E., et al.: Scan statistics on enron graphs. Comput. Math. Organ. Theor. 11(3), 229\u2013247 (2005)","journal-title":"Comput. Math. Organ. Theor."},{"key":"5_CR36","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H Samet","year":"2006","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco (2006)"},{"key":"5_CR37","volume-title":"Spatial Databases: A Tour","author":"S Shekhar","year":"2003","unstructured":"Shekhar, S., Chawla, S.: Spatial Databases: A Tour. Prentice Hall, Upper Saddle River (2003)"},{"issue":"1","key":"5_CR38","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1080\/13658810801949843","volume":"23","author":"S Shiode","year":"2009","unstructured":"Shiode, S., Shiode, N.: Detection of multi-scale clusters in network space. Int. J. Geogr. Inf. Sci. 23(1), 75\u201392 (2009)","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"5_CR39","first-page":"1","volume":"5","author":"T S\u00f8rensen","year":"1948","unstructured":"S\u00f8rensen, T.: A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on danish commons. Biologiske Skrifter 5, 1\u201334 (1948)","journal-title":"Biologiske Skrifter"},{"issue":"5","key":"5_CR40","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1023\/B:LAND.0000036114.32418.d4","volume":"19","author":"PG Spooner","year":"2004","unstructured":"Spooner, P.G., et al.: Spatial analysis of roadside acacia populations on a road network using the network k-function. Landsc. Ecol. 19(5), 491\u2013499 (2004)","journal-title":"Landsc. Ecol."},{"key":"5_CR41","volume-title":"Introduction to Data Mining","author":"P Tan","year":"2005","unstructured":"Tan, P., et al.: Introduction to Data Mining. Addison-Wesley, Boston (2005)"},{"issue":"3","key":"5_CR42","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1538-4632.2007.00704.x","volume":"39","author":"I Yamada","year":"2007","unstructured":"Yamada, I., Thill, J.C.: Local indicators of network-constrained clusters in spatial point patterns. Geogr. Anal. 39(3), 268\u2013292 (2007)","journal-title":"Geogr. Anal."},{"issue":"11","key":"5_CR43","doi-asserted-by":"crossref","first-page":"2919","DOI":"10.1109\/TKDE.2015.2445756","volume":"27","author":"K Yang","year":"2015","unstructured":"Yang, K., et al.: Capacity-constrained network-Voronoi diagram. IEEE Trans. Knowl. Data Eng. 27(11), 2919\u20132932 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Geographic Information Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45738-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T08:26:50Z","timestamp":1568363210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45738-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319457376","9783319457383"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45738-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}