{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:47:06Z","timestamp":1740894426530,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_16","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"178-187","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Algorithm for Approximating the Radii of Point Sets"],"prefix":"10.1007","author":[{"given":"Yinyu","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/jagm.2000.1127","volume":"38","author":"G. Barequet","year":"2001","unstructured":"Barequet, G., Har-Peled, S.: Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. J. Algorithms\u00a038, 91\u2013109 (2001)","journal-title":"J. Algorithms"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"B\u0103doiu, M., Har-Peled, S., Indyk, P.: Approximate Clustering via Core-sets. In: Proc. ACM Symp. Theory of Computing (2002)","DOI":"10.1145\/509943.509947"},{"key":"16_CR3","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"D. Bertsimas","year":"1998","unstructured":"Bertsimas, D., Ye, Y.: Semidefinite relaxations, multivariate normal distributions, and order statistics. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol.\u00a03, pp. 1\u201319. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF02123011","volume":"10","author":"H.L. Bodlaender","year":"1990","unstructured":"Bodlaender, H.L., Gritzmann, P., Klee, V., Van Leeuwen, J.: The Computational Complexity of Norm Maximization. Combinatorica\u00a010, 203\u2013225 (1990)","journal-title":"Combinatorica"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/978-1-4757-3145-3_7","volume-title":"Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems","author":"A. Brieden","year":"2000","unstructured":"Brieden, A., Gritzmann, P., Klee, V.: Inapproximability of Some Geometric and Quadratic Optimization Problems. In: Pardalos, P.M. (ed.) Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, pp. 96\u2013115. Kluwer, Dordrecht (2000)"},{"key":"16_CR6","unstructured":"Brieden, A., Gritzmann, P., Kannan, R., Klee, V., Lovasz, L., Simonovits, M.: Deterministic and Randomized Polynomial-time Approximation of Radii. To appear in Mathematika"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Brieden, A., Gritzmann, P., Kannan, R., Klee, V., Lovasz, L., Simonovits, M.: Approximation of Diameters: Randomization Doesn\u2019t Help. In: Proc. IEEE Symp. Foundations of Comp. Sci., pp. 244\u2013251 (1998)","DOI":"10.1109\/SFCS.1998.743451"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s00454-002-2756-x","volume":"28","author":"A. Brieden","year":"2002","unstructured":"Brieden, A.: Geometric Optimization Problems Likely Not Contained in APX. Discrete Comput. Geom.\u00a028, 201\u2013209 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"16_CR9","first-page":"1","volume":"73","author":"U. Faigle","year":"1996","unstructured":"Faigle, U., Kern, W., Streng, M.: Note on the Computaional Complexity of j-Radii of Polytopes in R n . Mathematical Programming\u00a073, 1\u20135 (1996)","journal-title":"Mathematical Programming"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems using Semi-definite Programming. Journal of the ACM\u00a042, 1115\u20131145 (1995)","journal-title":"Journal of the ACM"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF02187841","volume":"7","author":"P. Gritzmann","year":"1992","unstructured":"Gritzmann, P., Klee, V.: Inner and Outer j-Radii of Convex Bodies in Finite- Dimensional Normed Spaces. Discrete Comput. Geom.\u00a07, 255\u2013280 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BF01581243","volume":"59","author":"P. Gritzmann","year":"1993","unstructured":"Gritzmann, P., Klee, V.: Computational Complexity of Inner and Outer j-Radii of Polytopes in Finite-Dimenional Normed Spaces. Math. Program.\u00a059, 162\u2013213 (1993)","journal-title":"Math. Program."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0012-365X(94)00111-U","volume":"136","author":"P. Gritzmann","year":"1994","unstructured":"Gritzmann, P., Klee, V.: On the Complexity of Some basic Problems in Computational Convexity: I. Containment Problems. Discrete Math.\u00a0136, 129\u2013174 (1994)","journal-title":"Discrete Math."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Varadarajan, K.R.: Approximate Shape Fitting via Linearization. In: Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pp. 66\u201373 (2001)","DOI":"10.1109\/SFCS.2001.959881"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Varadarajan, K.: Projective Clustering in High Dimensions Using Core-sets. In: Proc. ACM Symp. Comput. Geom. (2002)","DOI":"10.1145\/513400.513440"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Varadarajan, K.: High-Dimensional Shap Fitting in Linear Time. In: Proc. ACM Symp. Comput. Geom. (2003)","DOI":"10.1145\/777797.777799"},{"key":"16_CR17","first-page":"189","volume":"26","author":"W.B. Johnson","year":"1984","unstructured":"Johnson, W.B., Lindenstrauss, J.: Extensions of Lipshitz Mapping into Hilbert Space. Comtemporary Mathematics\u00a026, 189\u2013206 (1984)","journal-title":"Comtemporary Mathematics"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s101070050100","volume":"86","author":"A. Nemirovskii","year":"1999","unstructured":"Nemirovskii, A., Roos, C., Terlaky, T.: On Maximization of Quadratic Forms Over Intersection of Ellipsoids with Common Center. Math. Program.\u00a086, 463\u2013473 (1999)","journal-title":"Math. Program."},{"key":"16_CR19","volume-title":"Handbook of Semidefinite Programming Theory, Algorithms, and Applications","author":"Y. Nesterov","year":"2000","unstructured":"Nesterov, Y.: Global Quadratic Optimization via Conic Relaxation. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming Theory, Algorithms, and Applications, Kluwer Academic Publishers, Norwell (2000)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Varadarajan, K., Venkatesh, S., Zhang, J.: On Approximating the Radii of Point Sets in High Dimensions. In: Proc. 43rd Annu. IEEE Sympos. Found. Comput. Sci. (2002)","DOI":"10.1109\/SFCS.2002.1181980"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:52:17Z","timestamp":1740840737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}