{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:29Z","timestamp":1725544049508},"publisher-location":"Berlin, Heidelberg","reference-count":59,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_3","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"21-34","source":"Crossref","is-referenced-by-count":7,"title":["Approximation Algorithms for Art Gallery Problems in Polygons and Terrains"],"prefix":"10.1007","author":[{"given":"Subir Kumar","family":"Ghosh","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/B978-044482537-7\/50003-6","volume-title":"Handbook of Computational Geometry","author":"P. Agarwal","year":"2000","unstructured":"Agarwal, P., Sharir, M.: Arrangements and their applications. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 49\u2013119. North-Holland, Amsterdam (2000)"},{"key":"3_CR2","unstructured":"Aggarwal, A.: The art gallery theorem: its variations, applications, and algorithmic aspects. Ph. D. Thesis, Johns Hopkins University (1984)"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1137\/1.9781611972870.12","volume-title":"Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007)","author":"Y. Amit","year":"2007","unstructured":"Amit, Y., Mitchell, J.S.B., Packer, E.: Locating guards for visibility coverage of polygons. In: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007), pp. 120\u2013134. SIAM, Philadelphia (2007)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T. Asano","year":"1986","unstructured":"Asano, T., Asano, T., Guibas, L.J., Hershberger, J., Imai, H.: Visibility of disjoint polygons. Algorithmica\u00a01, 49\u201363 (1986)","journal-title":"Algorithmica"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0031-3203(81)90002-9","volume":"13","author":"D. Avis","year":"1981","unstructured":"Avis, D., Toussaint, G.T.: An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognition\u00a013, 395\u2013398 (1981)","journal-title":"Pattern Recognition"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"1631","DOI":"10.1137\/S0097539704446384","volume":"36","author":"B. Ben-Moshe","year":"2007","unstructured":"Ben-Moshe, B., Katz, M., Mitchell, J.: A constant-factor approximation algorithm for optimal terrain guarding. SIAM Journal on Computing\u00a036, 1631\u20131647 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0925-7721(98)00024-8","volume":"11","author":"I. Bjorling-Sachs","year":"1998","unstructured":"Bjorling-Sachs, I.: Edge guards in rectilinear polygons. Computational Geometry: Theory and Applications\u00a011, 111\u2013123 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02574029","volume":"13","author":"I. Bjorling-Sachs","year":"1995","unstructured":"Bjorling-Sachs, I., Souvaine, D.L.: An efficient algorithm for guard placement in polygons with holes. Discrete & Computational Geometry\u00a013, 77\u2013109 (1995)","journal-title":"Discrete & Computational Geometry"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bose, P., Kirkpatrick, D.G., Li, Z.: Efficient algorithms for guarding or illuminating the surface of a polyhedral terrain. In: Proceedings of the 8th Canadian Conference on Computational Geometry, pp. 217\u2013222 (1996)","DOI":"10.1515\/9780773591134-039"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0925-7721(01)00070-0","volume":"23","author":"P. Bose","year":"2002","unstructured":"Bose, P., Lubiw, A., Munro, J.: Efficient visibility queries in simple polygons. Computational Geometry: Theory and Applications\u00a023, 313\u2013335 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0925-7721(95)00034-8","volume":"7","author":"P. Bose","year":"1997","unstructured":"Bose, P., Shermer, T., Toussaint, G.T., Zhu, B.: Guarding polyhedral terrains. Computational Geometry: Theory and Applications\u00a07, 173\u2013185 (1997)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"3_CR12","unstructured":"Chen, D., Estivill-Castro, V., Urrutia, J.: Optimal guarding of polygons and monotone chains. In: Proceedings of the 7th Canadian Conference on Computational Geometry, pp. 133\u2013138 (1995)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"V. Chvatal","year":"1975","unstructured":"Chvatal, V.: A combinatorial theorem in plane geometry. Journal of Combinatorial Theory, Series B\u00a018, 39\u201341 (1975)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"K.L. Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.R.: Improved approximation algorithms for geometric set cover. Discrete & Computational Geometry\u00a037, 43\u201358 (2007)","journal-title":"Discrete & Computational Geometry"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0747-7171(89)80003-3","volume":"7","author":"R. Cole","year":"1989","unstructured":"Cole, R., Sharir, M.: Visibility problems for polyhedral terrains. Journal of Symbolic Computation\u00a07, 11\u201330 (1989)","journal-title":"Journal of Symbolic Computation"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Couto, M.C., de Rezende, P.J., de Souza, C.C.: An exact and efficient algorithm for the orthogonal art gallery problem. In: Proceedings of the 20th Brazilian Symposium on Computer Graphics and Image Processing, pp. 87\u201394 (2007)","DOI":"10.1109\/SIBGRAPI.2007.15"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-68552-4_8","volume-title":"Experimental Algorithms","author":"M.C. Couto","year":"2008","unstructured":"Couto, M.C., de Rezende, P.J., de Souza, C.C.: Experimental evaluation of an exact algorithm for the orthogonal art gallery problem. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 101\u2013113. Springer, Heidelberg (2008)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Couto, M.C., de Rezende, P.J., de Souza, C.C.: An IP solution to the art gallery problem. In: Proceedings of the 25th Annual ACM Symposium on Computational Geometry, pp. 88\u201389 (2009)","DOI":"10.1145\/1542362.1542378"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(92)00029-L","volume":"50","author":"J. Czyzowicz","year":"1994","unstructured":"Czyzowicz, J., Rivera-Campo, E., Santoro, N., Urrutia, J., Zaks, J.: Guarding rectangular art galleries. Discrete Applied Mathematics\u00a050, 149\u2013157 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/B978-044482537-7\/50008-5","volume-title":"Handbook of Computational Geometry","author":"L. Floriani de","year":"2000","unstructured":"de Floriani, L., Magillo, P., Puppo, E.: Applications to computational geometry to geographic information systems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 333\u2013388. North-Holland, Amsterdam (2000)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-73951-7_15","volume-title":"Algorithms and Data Structures","author":"A. Deshpande","year":"2007","unstructured":"Deshpande, A., Kim, T., Demaine, E.D., Sarma, S.E.: A pseudopolynomial time O(log n)-approximation algorithm for art gallery problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 163\u2013174. Springer, Heidelberg (2007)"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0734-189X(84)80041-9","volume":"27","author":"H. Edelsbrunner","year":"1984","unstructured":"Edelsbrunner, H., O\u2019Rourke, J., Welzl, E.: Stationing guards in rectilinear art galleries. Computer Vision, Graphics, Image Processing\u00a027, 167\u2013176 (1984)","journal-title":"Computer Vision, Graphics, Image Processing"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ipl.2006.05.014","volume":"100","author":"A. Efrat","year":"2006","unstructured":"Efrat, A., Har-Peled, S.: Guarding galleries and terrains. Information Processing Letters\u00a0100, 238\u2013245 (2006)","journal-title":"Information Processing Letters"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0020-0190(01)00255-1","volume":"82","author":"S. Eidenbenz","year":"2002","unstructured":"Eidenbenz, S.: Approximation algorithms for terrain guarding. Information Processing Letters\u00a082, 99\u2013105 (2002)","journal-title":"Information Processing Letters"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-001-0040-8","volume":"31","author":"S. Eidenbenz","year":"2000","unstructured":"Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability results for guarding polygons and terrains. Algorithmica\u00a031, 79\u2013113 (2000)","journal-title":"Algorithmica"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Elbassioni, K., Krohn, E., Matijevi, D., Mestre, J., Severdija, D.: Improved approximations for guarding 1.5-dimensional terrains. Algorithmica (to appear, 2009)","DOI":"10.1007\/s00453-009-9358-4"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Everett, H., Rivera-Campo, E.: Edge guarding polyhedral terrains. Computational Geometry: Theory and Applications\u00a07 (1997)","DOI":"10.1016\/0925-7721(95)00051-8"},{"key":"3_CR28","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0095-8956(78)90059-X","volume":"24","author":"S. Fisk","year":"1978","unstructured":"Fisk, S.: A short proof of Chvatal\u2019s watchman theorem. Journal of Combinatorial Theory, Series B\u00a024, 374 (1978)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3_CR29","volume-title":"Computer and Intractability: A guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computer and Intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979)"},{"key":"3_CR30","unstructured":"Ghosh, S.K.: Approximation algorithms for art gallery problems. In: Proceedings of Canadian Information Processing Society Congress, pp. 429\u2013434 (1987)"},{"key":"3_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"S.K. Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, Cambridge (2007)"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons. Discrete Applied Mathematics (to appear, 2010)","DOI":"10.1016\/j.dam.2009.12.004"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-642-03685-9_11","volume-title":"APPROX and RANDOM 2009","author":"M. Gibson","year":"2009","unstructured":"Gibson, M., Kanade, G., Krohn, E., Varadarajan, K.: An approximation scheme for terrain guarding. In: Dinur, I., et al. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 140\u2013148. Springer, Heidelberg (2009)"},{"key":"3_CR34","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0925-7721(96)00014-4","volume":"6","author":"E. Gy\u00f6ri","year":"1996","unstructured":"Gy\u00f6ri, E., Hoffmann, F., Kriegel, K., Shermer, T.: Generalized guarding and partitioning for rectilinear polygons. Computational Geometry: Theory and Applications\u00a06, 21\u201344 (1996)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/BFb0032069","volume-title":"Automata, Languages and Programming","author":"F. Hoffmann","year":"1990","unstructured":"Hoffmann, F.: On the rectilinear art gallery problem. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 717\u2013728. Springer, Heidelberg (1990)"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Hoffmann, F., Kaufmann, M., Kriegel, K.: The art gallery theorem for polygons with holes. In: Proceedings of the 32nd IEEE Symposium on the Foundation of Computer Science, pp. 39\u201348 (1991)","DOI":"10.1109\/SFCS.1991.185346"},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0895480194265611","volume":"9","author":"F. Hoffmann","year":"1996","unstructured":"Hoffmann, F., Kriegel, K.: A graph-coloring result and its consequences for polygon-guarding problems. SIAM Journal on Discrete Mathematics\u00a09, 210\u2013224 (1996)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Honsberger, R.: Mathematical games II. Mathematical Associations for America (1979)","DOI":"10.1090\/dol\/004"},{"key":"3_CR39","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR40","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0604020","volume":"4","author":"J. Kahn","year":"1983","unstructured":"Kahn, J., Klawe, M., Kleitman, D.: Traditional galleries require fewer watchmen. SIAM Journal of Algebraic and Discrete Methods\u00a04, 194\u2013206 (1983)","journal-title":"SIAM Journal of Algebraic and Discrete Methods"},{"key":"3_CR41","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.comgeo.2007.02.002","volume":"39","author":"M. Katz","year":"2008","unstructured":"Katz, M., Roisman, G.: On guarding the vertices of rectilinear domains. Computational Geometry: Theory and Applications\u00a039, 219\u2013228 (2008)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"3_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/11682462_58","volume-title":"LATIN 2006: Theoretical Informatics","author":"J. King","year":"2006","unstructured":"King, J.: A 4-approximation algorithm for guarding 1.5-dimensional terrains. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 629\u2013640. Springer, Heidelberg (2006)"},{"key":"3_CR43","unstructured":"King, J.: VC-dimension of visibility on terrains. In: Proceedings of the 20th Canadian Conference on Computational Geometry, pp. 27\u201330 (2008)"},{"key":"3_CR44","unstructured":"King, J., Krohn, E.: The complexity of guarding terrains. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (to appear, 2010)"},{"key":"3_CR45","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0031-3203(92)90093-X","volume":"25","author":"A.A. Kooshesh","year":"1992","unstructured":"Kooshesh, A.A., Moret, B.: Three-coloring the vertices of a triangulated simple polygon. Pattern Recognition\u00a025, 443 (1992)","journal-title":"Pattern Recognition"},{"key":"3_CR46","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0734-189X(83)90065-8","volume":"22","author":"D.T. Lee","year":"1983","unstructured":"Lee, D.T.: Visibility of a simple polygon. Computer Vision, Graphics, and Image Processing\u00a022, 207\u2013221 (1983)","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"3_CR47","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"D.T. Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Transactions on Information Theory\u00a0IT-32, 276\u2013282 (1986)","journal-title":"IEEE Transactions on Information Theory IT-"},{"key":"3_CR48","doi-asserted-by":"crossref","unstructured":"Lubiw, A.: Decomposing polygons into convex quadrilaterals. In: Proceedings of the 1st ACM Symposium on Computational Geometry, pp. 97\u2013106 (1985)","DOI":"10.1145\/323233.323247"},{"key":"3_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1007\/11523468_110","volume-title":"Automata, Languages and Programming","author":"B.J. Nilsson","year":"2005","unstructured":"Nilsson, B.J.: Approximate guarding of monotone and rectilinear polygons. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1362\u20131373. Springer, Heidelberg (2005)"},{"key":"3_CR50","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BF01918136","volume":"211","author":"J. O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke, J.: An alternative proof of the rectilinear art gallery theorem. Journal of Geometry\u00a0211, 118\u2013130 (1983)","journal-title":"Journal of Geometry"},{"key":"3_CR51","first-page":"273","volume":"4","author":"J. O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke, J.: Galleries need fewer mobile guards: A variation on Chvatal\u2019s theorem. Geometricae Dedicata\u00a04, 273\u2013283 (1983)","journal-title":"Geometricae Dedicata"},{"key":"3_CR52","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, New York (1987)"},{"key":"3_CR53","unstructured":"Sack, J.: An O(nlogn) algorithm for decomposing simple rectilinear polygons into quadrilaterals. In: Proceedings of the 20th Allerton Conference, pp. 64\u201375 (1982)"},{"key":"3_CR54","first-page":"153","volume-title":"Computational Morphology","author":"J. Sack","year":"1988","unstructured":"Sack, J., Toussaint, G.T.: Guard placement in rectilinear polygons. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 153\u2013175. North-Holland, Amsterdam (1988)"},{"key":"3_CR55","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/malq.19950410212","volume":"41","author":"D. Schuchardt","year":"1995","unstructured":"Schuchardt, D., Hecker, H.D.: Two NP-hard art-gallery problems for ortho-polygons. Mathematical Logic Quarterly\u00a041, 261\u2013267 (1995)","journal-title":"Mathematical Logic Quarterly"},{"key":"3_CR56","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/5.163407","volume":"80","author":"T. Shermer","year":"1992","unstructured":"Shermer, T.: Recent results in art galleries. Proceedings of the IEEE\u00a080, 1384\u20131399 (1992)","journal-title":"Proceedings of the IEEE"},{"key":"3_CR57","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1016\/B978-044482537-7\/50023-1","volume-title":"Handbook of Computational Geometry","author":"J. Urrutia","year":"2000","unstructured":"Urrutia, J.: Art gallery and illumination problems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 973\u20131023. North-Holland, Amsterdam (2000)"},{"key":"3_CR58","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, New York (2001)"},{"key":"3_CR59","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1142\/S0218195907002264","volume":"17","author":"C. Worman","year":"2007","unstructured":"Worman, C., Keil, J.M.: Polygon decomposition and the orthogonal art gallery problem. International Journal of Computational Geometry and Applications\u00a017, 105\u2013138 (2007)","journal-title":"International Journal of Computational Geometry and Applications"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T12:10:19Z","timestamp":1711195819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}