{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T05:46:27Z","timestamp":1747374387525},"publisher-location":"Boston, MA","reference-count":16,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781475752755"},{"type":"electronic","value":"9780387356082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-0-387-35608-2_24","type":"book-chapter","created":{"date-parts":[[2013,12,29]],"date-time":"2013-12-29T21:57:25Z","timestamp":1388354245000},"page":"280-291","source":"Crossref","is-referenced-by-count":9,"title":["Server Placements, Roman Domination and Other Dominating Set Variants"],"prefix":"10.1007","author":[{"given":"Aris","family":"Pagourtzis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konrad","family":"Schlude","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathleen","family":"Steinh\u00f6fel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David Scot","family":"Taylor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","first-page":"97","volume-title":"Proc. 7th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1851 of LNCS","author":"J Alber","year":"2000","unstructured":"J. Alber, H.L. Bodlaender, H. Fernau, and R. Niedermeier. Fixed Parameter Algorithms for Planar Dominating Set and Related Problems. In Proc. 7th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1851 of LNCS, pages 97\u2013110, 2000."},{"key":"24_CR2","volume-title":"Springer Verlag","author":"G Ausiello","year":"1999","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation - Combinatorial optimization problems and their approximability properties. Springer Verlag, 1999."},{"key":"24_CR3","volume-title":"Winter","author":"J Arquilla","year":"1995","unstructured":"J. Arquilla and H. Fredricksen. Graphing an Optimal Grand Strategy. Military Operations Research, pages 3\u201317, Winter 1995."},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B Baker","year":"1994","unstructured":"B. Baker. Approximation Algorithms for NP-Complete Problems on Planar Graphs. J. ACM, 41 (1): 153\u2013180, 1994.","journal-title":"J. ACM"},{"key":"24_CR5","volume-title":"de Jaenish","author":"C.F","year":"1862","unstructured":"C.F. de Jaenish. Trait des Applications de l\u2019Analyse Mathematique au Jeau des Echecs. Petrograd, 1862."},{"key":"24_CR6","volume-title":"Applications and Variations of Domination in Graphs. PhD thesis","author":"PA Dreyer","year":"2000","unstructured":"P.A. Dreyer. Applications and Variations of Domination in Graphs. PhD thesis, Rutgers University, New Jersey, 2000."},{"key":"24_CR7","volume-title":"Freeman and Company","author":"MR Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability\/A Guide to the Theory of NP-Completeness. Freeman and Company, 1979."},{"key":"24_CR8","volume-title":"on Graph Theor","author":"S.T. Hedetniemi. Roman domination in graphs ii. Slides and notes from presentation at 9th Quadrienn. Aint. Conf","year":"2000","unstructured":"S.T. Hedetniemi. Roman domination in graphs ii. Slides and notes from presentation at 9th Quadrienn. Aint. Conf. on Graph Theor., Combinatorics, Algorithms, and Applications, June 2000."},{"key":"24_CR9","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"T.W. Haynes, S.T. Hedetniemi, and P.J. Slator. Fundamentals of Domination in Graphs. Marcel Dekker, New York, 1998."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"D.S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. System Sci, 9: 256\u2013278, 1974.","journal-title":"J. Comput. System Sci"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/S0097539792237462","volume":"24","author":"M Naor","year":"1995","unstructured":"M. Naor and R.M. Roth. Optimal file sharing in distributed networks. SIAM J. Comput., 24 (1): 158\u2013183, 1995.","journal-title":"SIAM J. Comput."},{"key":"24_CR12","volume-title":"Winter","author":"D Ochmanek","year":"1996","unstructured":"D. Ochmanek. Time to Restructure U.S. Defense Forces. ISSUES in Science and Technology, Winter 1996."},{"key":"24_CR13","volume-title":"Technical Report","author":"A Pagourtzis","year":"2001","unstructured":"A. Pagourtzis, P. Penna, K. Schiude, K. Steinh\u00f6fel, D.S. Taylor, and P. Widmayer. Server placements, roman domination and other dominating set variants. Technical Report 365, Department of Computer Science, ETH Z\u00fcrich, 2001."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"C.S. ReVelle and K.E. Rosing. Defendens Imperium Romanum: A Classical Problem in Military Strategy. American Mathematical Monthly, pages 585\u2013594, 2000.","DOI":"10.1080\/00029890.2000.12005243"},{"key":"24_CR15","first-page":"475","volume-title":"Proc. 29th ACM STOC","author":"R Raz","year":"1997","unstructured":"R. Raz and S. Safra. A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. In Proc. 29th ACM STOC, pages 475\u2013484, 1997."},{"key":"24_CR16","unstructured":"I. Stewart. Defend the roman empire! Scientific American, pages 94\u201395, December 1999."}],"container-title":["Foundations of Information Technology in the Era of Network and Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-35608-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T01:30:11Z","timestamp":1557797411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-35608-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781475752755","9780387356082"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-35608-2_24","relation":{},"subject":[],"published":{"date-parts":[[2002]]}}}