乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T07:12:34Z","timestamp":1683789154446},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T00:00:00Z","timestamp":1427846400000},"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":["Discrete Comput Geom"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00454-015-9676-z","type":"journal-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T02:38:53Z","timestamp":1428028733000},"page":"514-546","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["There are Plane Spanners of Degree 4 and Moderate Stretch Factor"],"prefix":"10.1007","volume":"53","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[]},{"given":"Iyad","family":"Kanj","sequence":"additional","affiliation":[]},{"given":"Ljubomir","family":"Perkovi\u0107","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,2]]},"reference":[{"key":"9676_CR1","doi-asserted-by":"crossref","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovi\u0107, L.: Plane spanners of maximum degree six. In: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 6198, pp. 19\u201330. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14165-2_3"},{"key":"9676_CR2","doi-asserted-by":"crossref","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovi\u0107, L.: The stretch factor of $${L}_1$$ L 1 - and $${L}_\\infty $$ L \u221e -Delaunay triangulations. In: Proceedings of the 20th Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 7501, pp. 205\u2013216. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-33090-2_19"},{"issue":"7","key":"9676_CR3","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1016\/j.comgeo.2013.04.002","volume":"46","author":"P Bose","year":"2013","unstructured":"Bose, P., Smid, M.: On plane geometric spanners: a survey and open problems. Comput. Geom. 46(7), 818\u2013830 (2013)","journal-title":"Comput. Geom."},{"issue":"6","key":"9676_CR4","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovi\u0107, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7(6), 609\u2013616 (2001)","journal-title":"Wirel. Netw."},{"issue":"3\u20134","key":"9676_CR5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00453-005-1168-8","volume":"42","author":"P Bose","year":"2005","unstructured":"Bose, P., Gudmundsson, J., Smid, M.: Constructing plane spanners of bounded degree and low weight. Algorithmica 42(3\u20134), 249\u2013264 (2005)","journal-title":"Algorithmica"},{"issue":"2","key":"9676_CR6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1142\/S0218195909002861","volume":"19","author":"P Bose","year":"2009","unstructured":"Bose, P., Smid, M., Xu, D.: Delaunay and diamond triangulations contain spanners of bounded degree. Int. J. Comput. Geom. Appl. 19(2), 119\u2013140 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9676_CR7","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.jda.2012.03.004","volume":"15","author":"P Bose","year":"2012","unstructured":"Bose, P., Carmi, P., Chaitman-Yerushalmi, L.: On bounded degree plane strong geometric spanners. J. Discrete Algorithms 15, 16\u201331 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"9676_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1142\/S0218195912600047","volume":"22","author":"P Bose","year":"2012","unstructured":"Bose, P., Damian, M., Dou\u00efeb, K., O\u2019Rourke, J., Seamone, B., Smid, M.H.M., Wuhrer, S.: $$\\pi \/2$$ \u03c0 \/ 2 -Angle Yao graphs are spanners. Int. J. Comput. Geom. Appl. 22(1), 61\u201382 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9676_CR9","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing on a bounded-degree plane spanner. In: Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG), pp. 299\u2013304 (2012)"},{"key":"9676_CR10","doi-asserted-by":"crossref","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: On plane constrained bounded-degree spanners. In: Proceedings of the 10th Latin American Symposium on Theoretical Informatics (LATIN). Lecture Notes in Computer Science, vol. 7256, pp. 85\u201396 (2012)","DOI":"10.1007\/978-3-642-29344-3_8"},{"key":"9676_CR11","doi-asserted-by":"crossref","unstructured":"Chew, L.P.: There is a planar graph almost as good as the complete graph. In: Proceedings of the Second Annual Symposium on Computational Geometry (SoCG), pp. 169\u2013177 (1986)","DOI":"10.1145\/10515.10534"},{"issue":"2","key":"9676_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"LP Chew","year":"1989","unstructured":"Chew, L.P.: There are planar graphs almost as good as the complete graph. J. Comput. Syst. Sci. 39(2), 205\u2013219 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9676_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1142\/S0129054196000105","volume":"7","author":"G Das","year":"1996","unstructured":"Das, G., Heffernan, P.: Constructing degree-3 spanners with other sparseness properties. Int. J. Found. Comput. Sci. 7(2), 121\u2013136 (1996)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9676_CR14","doi-asserted-by":"crossref","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science (FOCS), pp. 20\u201326. IEEE Computer Society, Silver Spring, MD (1987)","DOI":"10.1109\/SFCS.1987.18"},{"key":"9676_CR15","unstructured":"Kanj, I., Perkovi\u0107, L.: On geometric spanners of Euclidean and unit disk graphs. In. In Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), vol. hal-00231084, pp. 409\u2013420. HAL (2008)"},{"issue":"1","key":"9676_CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"JM Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom. 7(1), 13\u201328 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20132","key":"9676_CR17","first-page":"69","volume":"14","author":"XY Li","year":"2004","unstructured":"Li, X.Y., Wang, Y.: Efficient construction of low weight bounded degree planar spanner. Int. J. Comput. Geom. Appl. 14(1\u20132), 69\u201384 (2004)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"9676_CR18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(94)90133-3","volume":"54","author":"J Salowe","year":"1994","unstructured":"Salowe, J.: Euclidean spanner graphs with degree four. Discrete Appl. Math. 54(1), 55\u201366 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9676_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11036-006-4469-5","volume":"11","author":"Y Wang","year":"2006","unstructured":"Wang, Y., Li, X.Y.: Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Mob. Netw. Appl. 11(2), 161\u2013175 (2006)","journal-title":"Mob. Netw. Appl."},{"issue":"4","key":"9676_CR20","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1137\/110832458","volume":"42","author":"G Xia","year":"2013","unstructured":"Xia, G.: The stretch factor of the Delaunay triangulation is less than 1.998. SIAM J. Comput. 42(4), 1620\u20131659 (2013)","journal-title":"SIAM J. Comput."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-015-9676-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-015-9676-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-015-9676-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T17:18:02Z","timestamp":1566494282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-015-9676-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9676"],"URL":"https:\/\/doi.org\/10.1007\/s00454-015-9676-z","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4]]}}}