{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:39:43Z","timestamp":1725896383906},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_45","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"460-470","source":"Crossref","is-referenced-by-count":3,"title":["The Guarding Problem \u2013 Complexity and Approximation"],"prefix":"10.1007","author":[{"given":"T. V. Thirumala","family":"Reddy","sequence":"first","affiliation":[]},{"given":"D. Sai","family":"Krishna","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-92182-0_30","volume-title":"Algorithms and Computation","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Golovach, P.A., Hall, A., Mihal\u00e1k, M., Vicari, E., Widmayer, P.: How to guard a graph? In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 318\u2013329. Springer, Heidelberg (2008)"},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-642-02270-8_10","volume-title":"FAW 2009","author":"H. Nagamochi","year":"2009","unstructured":"Nagamochi, H.: Cop-robber guarding game with cycle robber region. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol.\u00a05598, pp. 74\u201384. Springer, Heidelberg (2009)"},{"key":"45_CR3","volume-title":"Computational complexity","author":"C.M. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.M.: Computational complexity. Addison-Wesley, Reading (1994)"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Reddy, T., Krishna, S., Rangan, P.: The guarding problem - complexity and approximation (2009), http:\/\/www.cse.iitm.ac.in\/~tiru\/tiru\/Publications_files\/iwoca-1.pdf","DOI":"10.1007\/978-3-642-10217-2_45"},{"key":"45_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:52:20Z","timestamp":1606186340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}