{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:12:38Z","timestamp":1743012758602,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_2","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:51Z","timestamp":1214505471000},"page":"4-7","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Partitions"],"prefix":"10.1007","author":[{"given":"Ping","family":"Deng","sequence":"first","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Eugene","family":"Shragowitz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1_2","doi-asserted-by":"crossref","unstructured":"Arora, S.: Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. In: Proc. 37th IEEE Symp. on Foundations of Computer Science, 1996, pp. 2\u201312","DOI":"10.1109\/SFCS.1996.548458"},{"key":"2_CR2_2","doi-asserted-by":"crossref","unstructured":"Arora, S.: Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In: Proc. 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 554\u2013563","DOI":"10.1007\/3-540-63248-4_5"},{"key":"2_CR3_2","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. J.\u00a0ACM 45, 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"2_CR4_2","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1109\/31.7610","volume":"35","author":"D.Z. Du","year":"1988","unstructured":"Du, D.Z., Hwang, F.K., Shing, M.T., Witbold, T.: Optimal routing trees. IEEE Trans. Circuits 35, 1335\u20131337 (1988)","journal-title":"IEEE Trans. Circuits"},{"key":"2_CR5_2","unstructured":"Du, D.-Z., Pan, L.-Q., Shing, M.-T.: Minimum edge length guillotine rectangular partition. Technical Report 0241886, Math. Sci. Res. Inst., Univ. California, Berkeley (1986)"},{"key":"2_CR6_2","first-page":"313","volume":"58","author":"D.-Z. Du","year":"1987","unstructured":"Du, D.-Z., Hsu, D.F., Xu, K.-J.: Bounds on guillotine ratio. Congressus Numerantium 58, 313\u2013318 (1987)","journal-title":"Congressus Numerantium"},{"key":"2_CR7_2","doi-asserted-by":"crossref","unstructured":"Gonzalez, T., Zheng, S.Q.: Bounds for partitioning rectilinear polygons. In: Proc. 1st Symp. on Computational Geometry (1985)","DOI":"10.1145\/323233.323269"},{"key":"2_CR8_2","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/S0747-7171(89)80042-2","volume":"7","author":"T. Gonzalez","year":"1989","unstructured":"Gonzalez, T., Zheng, S.Q.: Improved bounds for rectangular and guillotine partitions. J.\u00a0Symb. Comput. 7, 591\u2013610 (1989)","journal-title":"J. Symb. Comput."},{"key":"2_CR9_2","unstructured":"Lingas, A., Pinter, R.Y., Rivest, R.L., Shamir, A.: Minimum edge length partitioning of rectilinear polygons. In: Proc. 20th Allerton Conf. on Comm. Control and Compt., Illinos (1982)"},{"key":"2_CR10_2","unstructured":"Lingas, A.: Heuristics for minimum edge length rectangular partitions of rectilinear figures. In: Proc. 6th GI\u2010Conference, Dortmund, January 1983. Springer"},{"key":"2_CR11_2","first-page":"155","volume":"37","author":"M. Min","year":"2003","unstructured":"Min, M., Huang, S.C.-H., Liu, J., Shragowitz, E., Wu, W., Zhao, Y., Zhao, Y.: An Approximation Scheme for the Rectilinear Steiner Minimum Tree in Presence of Obstructions. Fields Inst. Commun. 37, 155\u2013164 (2003)","journal-title":"Fields Inst. Commun."},{"key":"2_CR12_2","unstructured":"Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: A\u00a0simple new method for the geometric k-MST problem. In: Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 402\u2013408."},{"issue":"3","key":"2_CR13_2","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1137\/S0097539796303299","volume":"28","author":"J.S.B. Mitchell","year":"1999","unstructured":"Mitchell, J.S.B., Blum, A., Chalasani, P., Vempala, S.: A\u00a0constant\u2010factor approximation algorithm for the geometric k-MST problem in the plane. SIAM J. Comput. 28(3), 771\u2013781 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"2_CR14_2","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1137\/S0097539797320281","volume":"29","author":"J.S.B. Mitchell","year":"1999","unstructured":"Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: Part\u202fII\u202f\u2013 A\u00a0simple polynomial\u2010time approximation scheme for geometric k-MST, TSP, and related problem. SIAM J. Comput. 29(2), 515\u2013544 (1999)","journal-title":"SIAM J. Comput."},{"key":"2_CR15_2","unstructured":"Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: Part\u202fIII\u202f\u2013 Faster polynomial\u2010time approximation scheme for geometric network optimization, manuscript, State University of New York, Stony Brook (1997)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:51Z","timestamp":1738272771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_2"}},"subtitle":["1986; Du, Pan, Shing"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_2","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}