{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:18Z","timestamp":1759638318853},"publisher-location":"Berlin, Heidelberg","reference-count":56,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16367-8_5","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T15:25:55Z","timestamp":1286465155000},"page":"41-64","source":"Crossref","is-referenced-by-count":12,"title":["Sublinear-time Algorithms"],"prefix":"10.1007","author":[{"given":"Artur","family":"Czumaj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Sohler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/S0895480102410973","volume":"16","author":"N. Alon","year":"2003","unstructured":"Alon, N., Dar, S., Parnas, M., Ron, D.: Testing of clustering. SIAM Journal on Discrete Mathematics\u00a016(3), 393\u2013417 (2003)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/S0022-0000(03)00008-4","volume":"67","author":"N. Alon","year":"2003","unstructured":"Alon, N., Fernandez de la Vega, W., Kannan, R., Karpinski, M.: Random sampling and approximation of MAX-CSPs. Journal of Computer and System Sciences\u00a067(2), 212\u2013243 (2003)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s004930070001","volume":"20","author":"N. Alon","year":"2000","unstructured":"Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. Combinatorica\u00a020(4), 451\u2013476 (2000)","journal-title":"Combinatorica"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/060667177","volume":"39","author":"N. Alon","year":"2009","unstructured":"Alon, N., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: it\u2019s all about regularity. SIAM Journal on Computing\u00a039(1), 143\u2013167 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/050633445","volume":"38","author":"N. Alon","year":"2008","unstructured":"Alon, N., Shapira, A.: Every monotone graph property is testable. SIAM Journal on Computing\u00a038(2), 505\u2013522 (2008)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1137\/06064888X","volume":"37","author":"N. Alon","year":"2008","unstructured":"Alon, N., Shapira, A.: A characterization of the (natural) graph properties testable with one-sided error. SIAM Journal on Computing\u00a037(6), 1703\u20131727 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Alon, N., Shapira, A.: Homomorphisms in graph property testing - A survey. In: Klazar, M., Kratochvil, J., Loebl, M., Matousek, J., Thomas, R., Valtr, P. (eds.) Topics in Discrete Mathematics, dedicated to Jarik Nesetril on the occasion of his 60th Birthday, pp. 281\u2013313","DOI":"10.1007\/3-540-33700-8_17"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S. Arora","year":"1999","unstructured":"Arora, S., Karger, D.R., Karpinski, M.: Polynomial time approximation schemes for dense instances of $\\mathcal{NP}$ -hard problems. Journal of Computer and System Sciences\u00a058(1), 193\u2013210 (1999)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V. Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM Journal on Computing\u00a033(3), 544\u2013562 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1007\/11523468_70","volume-title":"Automata, Languages and Programming","author":"M. B\u0103doiu","year":"2005","unstructured":"B\u0103doiu, M., Czumaj, A., Indyk, P., Sohler, C.: Facility location in sublinear time. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 866\u2013877. Springer, Heidelberg (2005)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Benjamini, I., Schramm, O., Shapira, A.: Every minor-closed property of sparse graphs is testable. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 393\u2013402 (2008)","DOI":"10.1145\/1374376.1374433"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J., Lov\u00e1sz, L., Sos, V.T., Szegedy, B., Vesztergombi, K.: Graph limits and parameter testing. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC) (2006)","DOI":"10.1145\/1132516.1132556"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Charikar, M., O\u2019Callaghan, L., Panigrahy, R.: Better streaming algorithms for clustering problems. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 30\u201339 (2003)","DOI":"10.1145\/780547.780548"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7531.24036","volume":"34","author":"B. Chazelle","year":"1987","unstructured":"Chazelle, B., Dobkin, D.P.: Intersection of convex objects in two and three dimensions. Journal of the ACM\u00a034(1), 1\u201327 (1987)","journal-title":"Journal of the ACM"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1137\/S009753970444572X","volume":"35","author":"B. Chazelle","year":"2006","unstructured":"Chazelle, B., Liu, D., Magen, A.: Sublinear geometric algorithms. SIAM Journal on Computing\u00a035(3), 627\u2013646 (2006)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1137\/S0097539702403244","volume":"34","author":"B. Chazelle","year":"2005","unstructured":"Chazelle, B., Rubinfeld, R., Trevisan, L.: Approximating the minimum spanning tree weight in sublinear time. SIAM Journal on Computing\u00a034(6), 1370\u20131379 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Chen, K.: On k-median clustering in high dimensions. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1177\u20131185 (2006)","DOI":"10.1145\/1109557.1109687"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/S0097539703435297","volume":"35","author":"A. Czumaj","year":"2005","unstructured":"Czumaj, A., Erg\u00fcn, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., Sohler, C.: Sublinear-time approximation of Euclidean minimum spanning tree. SIAM Journal on Computing\u00a035(1), 91\u2013109 (2005)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"5_CR19","doi-asserted-by":"publisher","first-page":"2499","DOI":"10.1137\/070681831","volume":"38","author":"A. Czumaj","year":"2009","unstructured":"Czumaj, A., Shapira, A., Sohler, C.: Testing hereditary properties of non-expanding bounded-degree graphs. SIAM Journal on Computing\u00a038(6), 2499\u20132510 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/3-540-44676-1_22","volume-title":"Algorithms - ESA 2001","author":"A. Czumaj","year":"2001","unstructured":"Czumaj, A., Sohler, C.: Property testing with geometric queries. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 266\u2013277. Springer, Heidelberg (2001)"},{"issue":"3","key":"5_CR21","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1137\/060672121","volume":"39","author":"A. Czumaj","year":"2009","unstructured":"Czumaj, A., Sohler, C.: Estimating the weight of metric minimum spanning trees in sublinear-time. SIAM Journal on Computing\u00a039(3), 904\u2013922 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"1-2","key":"5_CR22","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/rsa.20157","volume":"30","author":"A. Czumaj","year":"2007","unstructured":"Czumaj, A., Sohler, C.: Sublinear-time approximation for clustering via random sampling. Random Structures and Algorithms\u00a030(1-2), 226\u2013256 (2007)","journal-title":"Random Structures and Algorithms"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1137\/S009753970444199X","volume":"34","author":"A. Czumaj","year":"2005","unstructured":"Czumaj, A., Sohler, C.: Abstract combinatorial programs and efficient property testers. SIAM Journal on Computing,\u00a034(3), 580\u2013615 (2005)","journal-title":"SIAM Journal on Computing,"},{"issue":"3","key":"5_CR24","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s00224-009-9235-1","volume":"46","author":"A. Czumaj","year":"2010","unstructured":"Czumaj, A., Sohler, C.: Small space representations for metric min-sum k-clustering and their applications. Theory of Computing Systems\u00a046(3), 416\u2013442 (2010)","journal-title":"Theory of Computing Systems"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-45253-2_15","volume-title":"Algorithms - ESA 2000","author":"A. Czumaj","year":"2000","unstructured":"Czumaj, A., Sohler, C., Ziegler, M.: Property testing in computational geometry. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 155\u2013166. Springer, Heidelberg (2000)"},{"key":"5_CR26","first-page":"999","volume-title":"Handbook of Discrete and Computational Geometry","author":"M. Dyer","year":"2004","unstructured":"Dyer, M., Megiddo, N., Welzl, E.: Linear programming. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 999\u20131014. CRC Press, Boca Raton (2004)","edition":"2"},{"issue":"4","key":"5_CR27","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/S0097539704447304","volume":"35","author":"U. Feige","year":"2006","unstructured":"Feige, U.: On sums of independent random variables with unbounded variance and estimating the average degree in a graph. SIAM Journal on Computing\u00a035(4), 964\u2013984 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR28","first-page":"97","volume":"75","author":"E. Fischer","year":"2001","unstructured":"Fischer, E.: The art of uninformed decisions: A primer to property testing. Bulletin of the EATCS\u00a075, 97\u2013126 (2001)","journal-title":"Bulletin of the EATCS"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Frahling, G., Sohler, C.: Coresets in dynamic geometric data streams. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 209\u2013217 (2005)","DOI":"10.1145\/1060590.1060622"},{"issue":"2","key":"5_CR30","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"A. Frieze","year":"1999","unstructured":"Frieze, A., Kannan, R.: Quick approximation to matrices and applications. Combinatorica\u00a019(2), 175\u2013220 (1999)","journal-title":"Combinatorica"},{"issue":"6","key":"5_CR31","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1145\/1039488.1039494","volume":"51","author":"A. Frieze","year":"2004","unstructured":"Frieze, A., Kannan, R., Vempala, S.: Fast Monte-Carlo algorithms for finding low-rank approximations. Journal of the ACM\u00a051(6), 1025\u20131041 (2004)","journal-title":"Journal of the ACM"},{"key":"5_CR32","series-title":"DIMACS, Series in Discrete Mathetaics and Theoretical Computer Science","first-page":"45","volume-title":"Proc. DIMACS Workshop on Randomization Methods in Algorithm Design","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O.: Combinatorial property testing (a survey). In: Pardalos, P., Rajasekaran, S., Rolim, J. (eds.) Proc. DIMACS Workshop on Randomization Methods in Algorithm Design. DIMACS, Series in Discrete Mathetaics and Theoretical Computer Science, vol.\u00a043, pp. 45\u201359. American Mathematical Society, Providence (1997)"},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-1-4615-0005-6_5","volume-title":"Handbook of massive data sets","author":"O. Goldreich","year":"2002","unstructured":"Goldreich, O.: Property testing in massive graphs. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of massive data sets, pp. 123\u2013147. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"4","key":"5_CR34","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"Journal of the ACM"},{"issue":"2","key":"5_CR35","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00453-001-0078-7","volume":"32","author":"O. Goldreich","year":"2002","unstructured":"Goldreich, O., Ron, D.: Property Testing in Bounded Degree Graphs. Algorithmica\u00a032(2), 302\u2013343 (2002)","journal-title":"Algorithmica"},{"issue":"3","key":"5_CR36","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s004930050060","volume":"19","author":"O. Goldreich","year":"1999","unstructured":"Goldreich, O., Ron, D.: A sublinear bipartiteness tester for bounded degree graphs. Combinatorica\u00a019(3), 335\u2013373 (1999)","journal-title":"Combinatorica"},{"issue":"4","key":"5_CR37","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/rsa.20203","volume":"32","author":"O. Goldreich","year":"2008","unstructured":"Goldreich, O., Ron, D.: Approximating average parameters of graphs. Random Structures and Algorithms\u00a032(4), 473\u2013493 (2008)","journal-title":"Random Structures and Algorithms"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: Coresets for k-means and k-medians and their applications. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 291\u2013300 (2004)","DOI":"10.1145\/1007352.1007400"},{"issue":"1","key":"5_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00454-006-1271-x","volume":"37","author":"S. Har-Peled","year":"2007","unstructured":"Har-Peled, S., Kushal, A.: Smaller coresets for k-median and k-means clustering. Discrete & Computational Geometry\u00a037(1), 3\u201319 (2007)","journal-title":"Discrete & Computational Geometry"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Sublinear time algorithms for metric space problems. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 428\u2013434 (1999)","DOI":"10.1145\/301250.301366"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Indyk, P.: A sublinear time approximation scheme for clustering in metric spaces. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 154\u2013159 (1999)","DOI":"10.1109\/SFFCS.1999.814587"},{"key":"5_CR42","unstructured":"Indyk, P.: High-Dimensional Computational Geometry. PhD thesis, Stanford University (2000)"},{"key":"5_CR43","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/954092.954103","volume":"34","author":"R. Kumar","year":"2003","unstructured":"Kumar, R., Rubinfeld, R.: Sublinear time algorithms. SIGACT News\u00a034, 57\u201367 (2003)","journal-title":"SIGACT News"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: A simple linear time (1\u2009+\u2009\u03b5)-approximation algorithm for k-means clustering in any dimensions. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 454\u2013462 (2004)","DOI":"10.1109\/FOCS.2004.7"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1374","DOI":"10.1007\/11523468_111","volume-title":"Automata, Languages and Programming","author":"A. Kumar","year":"2005","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: Linear time algorithms for clustering problems in any dimensions. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1374\u20131385. Springer, Heidelberg (2005)"},{"key":"5_CR46","unstructured":"Lov\u00e1sz, L., Szegedy, B.: Graph limits and testing hereditary graph properties. Technical Report, MSR-TR-2005-110, Microsoft Research (August 2005)"},{"issue":"1-3","key":"5_CR47","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/B:MACH.0000033114.18632.e0","volume":"56","author":"R. Mettu","year":"2004","unstructured":"Mettu, R., Plaxton, G.: Optimal time bounds for approximate clustering. Machine Learning\u00a056(1-3), 35\u201360 (2004)","journal-title":"Machine Learning"},{"issue":"1-3","key":"5_CR48","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/B:MACH.0000033115.78247.f0","volume":"56","author":"A. Meyerson","year":"2004","unstructured":"Meyerson, A., O\u2019Callaghan, L., Plotkin, S.: A k-median algorithm with running time independent of data size. Machine Learning\u00a056(1-3), 61\u201387 (2004)","journal-title":"Machine Learning"},{"key":"5_CR49","unstructured":"Mishra, N., Oblinger, D., Pitt, L.: Sublinear time approximate clustering. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 439\u2013447 (2001)"},{"key":"5_CR50","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science\u00a01(2) (August 2005)","DOI":"10.1561\/0400000002"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Nguyen, H., Onak, K.: Constant-time approximation algorithms via local improvements. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 489\u2013498 (2008)","DOI":"10.1109\/FOCS.2008.81"},{"issue":"6","key":"5_CR52","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1016\/j.jcss.2006.03.002","volume":"72","author":"M. Parnas","year":"2006","unstructured":"Parnas, M., Ron, D., Rubinfeld, R.: Tolerant property testing and distance approximation. Journal of Computer and System Sciences\u00a072(6), 1012\u20131042 (2006)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR53","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-1-4615-0013-1_15","volume-title":"Handobook of Randomized Algorithms","author":"D. Ron","year":"2001","unstructured":"Ron, D.: Property testing. In: Pardalos, P.M., Rajasekaran, S., Reif, J., Rolim, J.D.P. (eds.) Handobook of Randomized Algorithms, vol.\u00a0II, pp. 597\u2013649. Kluwer Academic Publishers, Dordrecht (2001)"},{"issue":"2","key":"5_CR54","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/S0097539701388884","volume":"34","author":"M. Thorup","year":"2005","unstructured":"Thorup, M.: Quick k-median, k-center, and facility location for sparse graphs. SIAM Journal on Computing\u00a034(2), 405\u2013432 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR55","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2004","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, New York (2004)"},{"key":"5_CR56","doi-asserted-by":"crossref","unstructured":"Yoshida, Y., Yamamoto, M., Ito, H.: Improved constant-time approximation algorithms for maximum independent sets and maximum matchings. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 225\u2013234 (2009)","DOI":"10.1145\/1536414.1536447"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T09:10:46Z","timestamp":1559725846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}