乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:21Z","timestamp":1725489801846},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73951-7_28","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"312-324","source":"Crossref","is-referenced-by-count":5,"title":["Spanners for Geometric Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Martin","family":"F\u00fcrer","sequence":"first","affiliation":[]},{"given":"Shiva Prasad","family":"Kasiviswanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Eppstein, D.: Testing bipartiteness of geometric intersection graphs. In: SODA 2004, SIAM, pp. 860\u2013868 (2004)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/564585.564602","volume":"33","author":"R. Rajaraman","year":"2002","unstructured":"Rajaraman, R.: Topology control and routing in ad hoc networks: A survey. SIGACT News\u00a033, 60\u201373 (2002)","journal-title":"SIGACT News"},{"issue":"2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/wcm.107","volume":"3","author":"X.Y. Li","year":"2003","unstructured":"Li, X.Y.: Algorithmic, geometric and graphs issues in wireless networks. Wireless Communications and Mobile Computing\u00a03(2), 119\u2013140 (2003)","journal-title":"Wireless Communications and Mobile Computing"},{"key":"28_CR4","unstructured":"Erickson, J.: On the relative complexities of some geometric problems. In: CCCG 1995, pp. 85\u201390 (1995)"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A.C.C. Yao","year":"1982","unstructured":"Yao, A.C.C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing\u00a011(4), 721\u2013736 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF02574698","volume":"6","author":"P.K. Agarwal","year":"1991","unstructured":"Agarwal, P.K., Edelsbrunner, H., Schwarzkopf, O., Welzl, E.: Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry\u00a06, 407\u2013422 (1991)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/S0097539703436357","volume":"35","author":"J. Gao","year":"2005","unstructured":"Gao, J., Zhang, L.: Well-separated pair decomposition for the unit-disk graph metric and its applications. SIAM Journal on Computing\u00a035(1), 151\u2013169 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-540-45077-1_9","volume-title":"Fundamentals of Computation Theory","author":"J. Gudmundsson","year":"2003","unstructured":"Gudmundsson, J.: Constructing sparse t-spanners with small separators. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.\u00a02751, pp. 86\u201397. Springer, Heidelberg (2003)"},{"key":"28_CR9","unstructured":"Gudmundsson, J.: Personal communication (2006)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/11970125_14","volume-title":"Approximation and Online Algorithms","author":"M. F\u00fcrer","year":"2007","unstructured":"F\u00fcrer, M., Kasiviswanathan, S.P.: Approximate distance queries in disk graphs. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol.\u00a04368, pp. 174\u2013187. Springer, Heidelberg (2007)"},{"issue":"4","key":"28_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01293483","volume":"13","author":"P.K. Agarwal","year":"1995","unstructured":"Agarwal, P.K., Matou\u0161ek, J.: Dynamic half-space range reporting and its applications. Algorithmica\u00a013(4), 325\u2013345 (1995)","journal-title":"Algorithmica"},{"key":"28_CR12","unstructured":"F\u00fcrer, M., Kasiviswanathan, S.P.: Spanners for geometric intersection graphs (2007), Available at \n \n http:\/\/www.cse.psu.edu\/~kasivisw\/spanner.pdf"},{"key":"28_CR13","unstructured":"Ruppert, J., Seidel, R.: Approximating the d-dimensional complete euclidean graph. In: CCCG 1991, pp. 207\u2013210 (1991)"},{"issue":"3","key":"28_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.comgeo.2004.04.003","volume":"29","author":"P. Bose","year":"2004","unstructured":"Bose, P., Maheshwari, A., Narasimhan, G., Smid, M.H.M., Zeh, N.: Approximating geometric bottleneck shortest paths. Comput. Geom\u00a029(3), 233\u2013249 (2004)","journal-title":"Comput. Geom"},{"key":"28_CR15","unstructured":"Lukovszki, T.: New results on geometric spanners and their applications. PhD. thesis, University of Paderborn (1999)"},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to K-nearest-neighbors and N-body potential fields. J. ACM\u00a042(1), 67\u201390 (1995)","journal-title":"J. ACM"},{"key":"28_CR17","unstructured":"Callahan, P.B., Kosaraju, S.R.: Faster algorithms for some geometric graph problems in higher dimensions. In: SODA 1993, SIAM, pp. 291\u2013300 (1993)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Smid, M.: The well-separated pair decomposition and its applications. In: Gonzalez, T. (ed.) Handbook on Approximation Algorithms and Metaheuristics, Chapman & Hall\/CRC (to appear)","DOI":"10.1201\/9781420010749.ch53"},{"key":"28_CR19","unstructured":"Har-Peled, S.: Approximation algorithms in geometry. Available at: \n \n http:\/\/valis.cs.uiuc.edu\/~sariel\/research\/book\/aprx\/"},{"issue":"6","key":"28_CR20","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1142\/S0218195999000303","volume":"9","author":"M.W. Bern","year":"1999","unstructured":"Bern, M.W., Eppstein, D., Teng, S.H.: Parallel construction of quadtrees and quality triangulations. Int. J. Computational Geometry & Applications\u00a09(6), 517\u2013532 (1999)","journal-title":"Int. J. Computational Geometry & Applications"},{"key":"28_CR21","first-page":"35","volume":"1","author":"P. Gupta","year":"1999","unstructured":"Gupta, P., Janardan, R., Smid, M.: Algorithms for some intersection searching problems involving circular objects. International Journal of Mathematical Algorithms\u00a01, 35\u201352 (1999)","journal-title":"International Journal of Mathematical Algorithms"},{"issue":"4","key":"28_CR22","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/PL00009478","volume":"22","author":"T.M. Chan","year":"1999","unstructured":"Chan, T.M.: Geometric applications of a randomized optimization technique. Discrete & Computational Geometry\u00a022(4), 547\u2013567 (1999)","journal-title":"Discrete & Computational Geometry"},{"issue":"4","key":"28_CR23","first-page":"446","volume":"6","author":"D. Krznaric","year":"1999","unstructured":"Krznaric, D., Levcopoulos, C., Nilsson, B.J.: Minimum spanning trees in d dimensions. Nord. J. Comput.\u00a06(4), 446\u2013461 (1999)","journal-title":"Nord. J. Comput."},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/3-540-61680-2_79","volume-title":"Algorithms - ESA \u201996","author":"S.R. Arikati","year":"1996","unstructured":"Arikati, S.R., Chen, D.Z., Chew, L.P., Das, G., Smid, M.H.M., Zaroliagis, C.D.: Planar spanners and approximate shortest path queries among obstacles in the plane. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 514\u2013528. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:05:54Z","timestamp":1619517954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739487","9783540739517"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}