{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T08:47:52Z","timestamp":1764060472268},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_18","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T01:15:25Z","timestamp":1306545325000},"page":"147-155","source":"Crossref","is-referenced-by-count":5,"title":["Complexity of Total {k}-Domination and Related Problems"],"prefix":"10.1007","author":[{"given":"Jing","family":"He","sequence":"first","affiliation":[]},{"given":"Hongyu","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Aram, H., Sheikholeslami, S.M.: On the total {k}-domination and total {k}-domatic number of graphs. Bull. Malays. Math. Sci. Soc. (to appear)","key":"18_CR1"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(95)00094-D","volume":"159","author":"D.W. Bange","year":"1996","unstructured":"Bange, D.W., Barkauskas, A.E., Host, L.H., Slater, P.J.: Generalized domination and efficient domination in graphs. Discrete Math.\u00a0159, 1\u201311 (1996)","journal-title":"Discrete Math."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.dam.2004.11.009","volume":"155","author":"P. Berman","year":"2007","unstructured":"Berman, P., DasGupta, B., Sontag, E.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discrete Appl. Math.\u00a0155, 733\u2013749 (2007)","journal-title":"Discrete Appl. Math."},{"key":"18_CR4","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern graph theory. Graduate Texts in Mathematics, vol.\u00a0184. Springer, Berlin (1998)"},{"doi-asserted-by":"crossref","unstructured":"Chen, J., Hou, X., Li, N.: The total {k}-domatic number of wheels and complete graphs. J. Comb. Optim. (to appear)","key":"18_CR5","DOI":"10.1007\/s10878-010-9374-y"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"E.J. Cockayne","year":"1980","unstructured":"Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks\u00a010, 211\u2013219 (1980)","journal-title":"Networks"},{"unstructured":"Domke, G.S., Hedetniemi, S.T., Laskar, R.C., Fricke, G.: Relationships between integer and fractional parameters of graphs. In: Proceedings of the Sixth Quadrennial Conference on the Theory and Applications of Graphs, Graph Theory, Combinatorics, and Applications, Kalamazoo, MI, vol.\u00a02, pp. 371\u2013387 (1991)","key":"18_CR7"},{"issue":"4","key":"18_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for aproximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0097539700380754","volume":"32","author":"U. Feige","year":"2002","unstructured":"Feige, U., Halld\u00f3rsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM J. Comput.\u00a032(1), 172\u2013195 (2002)","journal-title":"SIAM J. Comput."},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45032-7_4","volume-title":"Self-Stabilizing Systems","author":"M. Gairing","year":"2003","unstructured":"Gairing, M., Hedetniemi, S.T., Kristiansen, P., McRae, A.A.: Self-stabilizing algorithms for {k}-domination. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol.\u00a02704, pp. 49\u201360. Springer, Heidelberg (2003)"},{"key":"18_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"18_CR12","volume-title":"Domination in Graphs: Advanced Topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"key":"18_CR13","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"unstructured":"Lee, C.M.: Labelled Domination and Its Variants. PhD thesis, National Chung Cheng University (2006)","key":"18_CR14"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10878-008-9144-2","volume":"18","author":"N. Li","year":"2009","unstructured":"Li, N., Hou, X.: On the total {k}-domination number of Cartesian products of graphs. J. Comb. Optim.\u00a018, 173\u2013178 (2009)","journal-title":"J. Comb. Optim."},{"unstructured":"Sheikholeslami, S.M., Volkmann, L.: The {k}-domatic number of a graph. Aequationes Math. (to appear)","key":"18_CR16"},{"doi-asserted-by":"crossref","unstructured":"Sheikholeslami, S.M., Volkmann, L.: The total {k}-domatic number of a graph. J. Comb. Optim. (to appear)","key":"18_CR17","DOI":"10.1007\/s10878-010-9352-4"},{"key":"18_CR18","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2004","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T22:51:25Z","timestamp":1553727085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}