{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:15:17Z","timestamp":1725563717187},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_19","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:47:32Z","timestamp":1283338052000},"page":"219-230","source":"Crossref","is-referenced-by-count":1,"title":["Estimating the Average of a Lipschitz-Continuous Function from One Sample"],"prefix":"10.1007","author":[{"given":"Abhimanyu","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Kempe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. In: Proc. ACM Symposium on Theory of Computing (2001)","DOI":"10.1145\/380752.380755"},{"key":"19_CR2","first-page":"3","volume":"4","author":"N.S. Bakhvalov","year":"1959","unstructured":"Bakhvalov, N.S.: On approximate calculation of integrals. Vestnik MGU, Ser. Mat. Mekh. Astron. Fiz. Khim\u00a04, 3\u201318 (1959)","journal-title":"Vestnik MGU, Ser. Mat. Mekh. Astron. Fiz. Khim"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00453-007-9093-7","volume":"50","author":"I. Baran","year":"2008","unstructured":"Baran, I., Demaine, E., Katz, D.: Optimally adaptive integration of univariate lipschitz functions. Algorithmica\u00a050(2), 255\u2013278 (2008)","journal-title":"Algorithmica"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Das, A., Kempe, D.: Sensor selection for minimizing worst-case prediction error. In: Proc. ACM\/IEEE International Conference on Information Processing in Sensor Networks (2008)","DOI":"10.1109\/IPSN.2008.40"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: Proc. IEEE Symposium on Foundations of Computer Science (2003)","DOI":"10.1109\/SFCS.2003.1238226"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1006\/jcom.1995.1020","volume":"11","author":"P. Mathe","year":"1995","unstructured":"Mathe, P.: The optimal error of monte carlo integration. Journal of Complexity\u00a011(4), 394\u2013415 (1995)","journal-title":"Journal of Complexity"},{"key":"19_CR8","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1990","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1990)"},{"issue":"5","key":"19_CR9","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/BF01397555","volume":"53","author":"E. Novak","year":"1988","unstructured":"Novak, E.: Stochastic properties of quadrature formulas. Numer. Math.\u00a053(5), 609\u2013620 (1988)","journal-title":"Numer. Math."},{"key":"19_CR10","volume-title":"Information-Based Complexity","author":"J.F. Traub","year":"1988","unstructured":"Traub, J.F., Wasilkowski, G.W., Wo\u017aniakowski, H.: Information-Based Complexity. Academic Press, New York (1988)"},{"key":"19_CR11","volume-title":"Complexity and Information","author":"J.F. Traub","year":"1998","unstructured":"Traub, J.F., Werschulz, A.G.: Complexity and Information. Cambridge University Press, Cambridge (1998)"},{"issue":"4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0885-064X(92)90001-R","volume":"8","author":"H. Wozniakowski","year":"1992","unstructured":"Wozniakowski, H.: Average case complexity of linear multivariate problems part 1: Theory. Journal of Complexity\u00a08(4), 337\u2013372 (1992)","journal-title":"Journal of Complexity"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/0885-064X(92)90002-S","volume":"8","author":"H. Wozniakowski","year":"1992","unstructured":"Wozniakowski, H.: Average case complexity of linear multivariate problems part 2: Applications. Journal of Complexity\u00a08(4), 373\u2013392 (1992)","journal-title":"Journal of Complexity"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T06:03:05Z","timestamp":1552975385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}