{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:55:17Z","timestamp":1774418117146,"version":"3.50.1"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,4]]},"abstract":"<jats:p> Let \u03b1<jats:sub>2<\/jats:sub>(G), \u03b3(G) and \u03b3<jats:sub>c<\/jats:sub>(G) be the 2-independence number, the domination number, and the connected domination number of a graph G respectively. Then \u03b1<jats:sub>2<\/jats:sub>(G) \u2264 \u03b3 (G) \u2264 \u03b3<jats:sub>c<\/jats:sub>(G). In this paper , we present a simple heuristic for Minimum Connected Dominating Set in graphs. When running on a graph G excluding K<jats:sub>m<\/jats:sub> (the complete graph of order m) as a minor, the heuristic produces a connected dominating set of cardinality at most 7\u03b1<jats:sub>2<\/jats:sub>(G) - 4 if m = 3, or at most [Formula: see text] if m \u2265 4. In particular, if running on a planar graph G, the heuristic outputs a connected dominating set of cardinality at most 15\u03b1<jats:sub>2<\/jats:sub>(G) - 5. <\/jats:p>","DOI":"10.1142\/s0129054103001753","type":"journal-article","created":{"date-parts":[[2003,6,19]],"date-time":"2003-06-19T08:43:20Z","timestamp":1056012200000},"page":"323-333","source":"Crossref","is-referenced-by-count":21,"title":["A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS"],"prefix":"10.1142","volume":"14","author":[{"given":"PENG-JUN","family":"WAN","sequence":"first","affiliation":[{"name":"Department of Computer Science, Illinois Institute of Technology, Chicago, Illinois 60616, USA"}]},{"given":"KHALED M.","family":"ALZOUBI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Illinois Institute of Technology, Chicago, Illinois 60616, USA"}]},{"given":"OPHIR","family":"FRIEDER","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Illinois Institute of Technology, Chicago, Illinois 60616, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"rf6","first-page":"71","volume":"13","author":"Duchet P.","journal-title":"Annal. Disc. Math."},{"key":"rf8","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009201"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1145\/185675.306789"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250205"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:39:24Z","timestamp":1565138364000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":7,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,4]]}},"alternative-id":["10.1142\/S0129054103001753"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001753","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}