{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:44Z","timestamp":1750308044895,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,5]],"date-time":"2006-06-05T00:00:00Z","timestamp":1149465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,6,5]]},"DOI":"10.1145\/1137856.1137861","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"21-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope"],"prefix":"10.1145","author":[{"given":"Yulai","family":"Xie","sequence":"first","affiliation":[{"name":"University at Buffalo, Buffalo, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[{"name":"University of North Carolina, Chapel Hill, NC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[{"name":"University at Buffalo, Buffalo, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Geometric Approximation via Coresets,\" Survey","author":"Agarwal P.K.","year":"2005","unstructured":"P.K. Agarwal , S. Har-Peled , and K. R. Varadarajan , \" Geometric Approximation via Coresets,\" Survey , 2005 . P.K. Agarwal, S. Har-Peled, and K. R. Varadarajan, \"Geometric Approximation via Coresets,\" Survey, 2005."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623401390902"},{"key":"e_1_3_2_1_3_1","volume-title":"manuscript","author":"Barvinok A.","year":"2003","unstructured":"A. Barvinok , G. Blekherman , \" Convex Geometry of Orbits\" , manuscript , 2003 . A.Barvinok, G.Blekherman, \"Convex Geometry of Orbits\", manuscript, 2003."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/644108.644240"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509947"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580439"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"M.Grotschel L.Lovasz and A.Schrijver \"Geometric Algorithms and Combinatorial Optimization\" Springer New York 1988.  M.Grotschel L.Lovasz and A.Schrijver \"Geometric Algorithms and Combinatorial Optimization\" Springer New York 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"e_1_3_2_1_8_1","first-page":"1","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"Gonzaga C.","year":"1989","unstructured":"C. Gonzaga , \" An algorithm for solving linear programming problems in operations , Progress in Mathematical Programming: Interior Point and Related Methods \", Springer Verlag , New York , 1989 , pp. 1 -- 28 . C.Gonzaga, \"An algorithm for solving linear programming problems in operations, Progress in Mathematical Programming: Interior Point and Related Methods\", Springer Verlag, New York, 1989, pp. 1--28."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/513400.513440"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-1118-2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.21.2.307"},{"key":"e_1_3_2_1_12_1","volume-title":"manuscript","author":"Kumar P.","year":"2002","unstructured":"P. Kumar , J. Mitchell , A. Yildirim , \" Computing Core-Sets and Approximate Smallest Enclosing Hyperspheres in High Dimensions\" , manuscript , 2002 . P.Kumar, J.Mitchell, A.Yildirim, \"Computing Core-Sets and Approximate Smallest Enclosing Hyperspheres in High Dimensions\", manuscript, 2002."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582144"},{"key":"e_1_3_2_1_14_1","volume-title":"Journal of Optimization Theory and Applications","author":"Kumar P.","year":"2005","unstructured":"P. Kumar , A. Yildirim , \" Minimum volume enclosing ellipsoids and core sets , Journal of Optimization Theory and Applications \", 2005 . To Appear . P.Kumar, A.Yildirim, \"Minimum volume enclosing ellipsoids and core sets, Journal of Optimization Theory and Applications\", 2005. To Appear."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.4.1051"},{"key":"e_1_3_2_1_16_1","volume-title":"manuscript","author":"Panigrahy R.","year":"2004","unstructured":"R. Panigrahy , \" Minimum enclosing polytope in high dimensions\" , manuscript , 2004 . R.Panigrahy, \"Minimum enclosing polytope in high dimensions\", manuscript, 2004."},{"key":"e_1_3_2_1_17_1","first-page":"157","volume-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"Ye Y.","year":"1997","unstructured":"Y. Ye , \" Interior Point Algorithms Theory and Analysis\" , Wiley-Interscience Series in Discrete Mathematics and Optimization , John Wiley and Sons Inc ., pp. 157 , 1997 . Y.Ye, \"Interior Point Algorithms Theory and Analysis\", Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley and Sons Inc., pp. 157, 1997."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623401397230"}],"event":{"name":"SoCG06: 22nd Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Sedona Arizona USA","acronym":"SoCG06"},"container-title":["Proceedings of the twenty-second annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1137856.1137861","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1137856.1137861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:30Z","timestamp":1750259670000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1137856.1137861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,5]]},"references-count":18,"alternative-id":["10.1145\/1137856.1137861","10.1145\/1137856"],"URL":"https:\/\/doi.org\/10.1145\/1137856.1137861","relation":{},"subject":[],"published":{"date-parts":[[2006,6,5]]},"assertion":[{"value":"2006-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}