{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:17Z","timestamp":1725488537703},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_15","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:26:17Z","timestamp":1186741577000},"page":"83-95","source":"Crossref","is-referenced-by-count":1,"title":["Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs"],"prefix":"10.1007","author":[{"given":"William","family":"Duckworth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Mans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01787474","volume":"6","author":"N. Alon","year":"1990","unstructured":"Alon, N.: Transversal Numbers of Uniform Hypergraphs. Graphs and Combinatorics 6(1) (1990) 1\u20134","journal-title":"Graphs and Combinatorics"},{"key":"15_CR2","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B.: Random Graphs. Academic Press, London (1985)"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1137\/S0895480199353780","volume":"13","author":"T. Caro","year":"2000","unstructured":"Caro, T., West, D.B. and Yuster, R.: Connected Domination and Spanning Trees with Many Leaves. SIAM Journal on Discrete Mathematics 13(2) (2000) 202\u2013211","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Y.P. and Liestman, A.L.: Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad-Hoc Networks. In: Proceedings of 3rd ACM International Symposium on Mobile Ad-Hoc Networking and Computing. ACM press (2002), 165\u2013172","DOI":"10.1145\/513800.513821"},{"key":"15_CR5","unstructured":"Diestel, R.: Graph Theory. Springer-Verlag (1997)"},{"key":"15_CR6","unstructured":"Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J. and Srinivasan, A.: Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (2003) 717\u2013724"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0012-365X(96)00233-6","volume":"167\/168","author":"J.E. Dunbar","year":"1997","unstructured":"Dunbar, J.E., Grossman, J.W., Hattingh, J.H., Hedetniemi, S.T. and McRae, A.A.: On Weakly-Connected Domination in Graphs. Discrete Mathematics 167\/168 (1997) 261\u2013269","journal-title":"Discrete Mathematics"},{"key":"15_CR8","unstructured":"Garey, M.R. and Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company (1979)"},{"issue":"1\u20133","key":"15_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0012-365X(95)00334-S","volume":"169","author":"J.W. Grossman","year":"1997","unstructured":"Grossman, J.W.: Dominating Sets whose Closed Stars form Spanning Trees. Discrete Mathematics 169(1\u20133) (1997) 83\u201394","journal-title":"Discrete Mathematics"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S. and Khuller, S.: Approximation Algorithms for Connected Dominating Sets. Algorithmica 20 (1998) 374\u2013387","journal-title":"Algorithmica"},{"key":"15_CR11","volume-title":"Domination in Graphs: Advanced topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T. and Slater, P.J.: Domination in Graphs: Advanced topics. Marcel Dekker, New York (1998)"},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics 13(4) (1975) 383\u2013390","journal-title":"Discrete Mathematics"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Wormald, N.C.: Models of Random Regular Graphs. In: Surveys in Combinatorics. Cambridge University Press, (1999) 239\u2013298","DOI":"10.1017\/CBO9780511721335.010"},{"key":"15_CR14","unstructured":"Wormald, N.C.: The Differential Equation Method for Random Graph Processes and Greedy Algorithms. In: M. Karo\u0144ski and H.-J. Pr\u00f6mel (editors), Lectures on Approximation and Randomized Algorithms. PWN Warsaw (1999) 73\u2013155"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T09:38:14Z","timestamp":1550741894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}