{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:12Z","timestamp":1759063632939},"reference-count":15,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1051\/ro\/2013034","type":"journal-article","created":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T21:37:10Z","timestamp":1367530630000},"page":"199-221","source":"Crossref","is-referenced-by-count":4,"title":["Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic"],"prefix":"10.1051","volume":"47","author":[{"given":"Christian","family":"Laforest","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raksmey","family":"Phan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2013,5,2]]},"reference":[{"key":"R1","unstructured":"Baez-Duarte L., Hardy\u2013ramanujan\u2019s asymptotic formula for partitions and the central limit theorem.Adv. Math.125(1997) 114\u2013120."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Bourgeois N., Escoffier B. and Paschos V.T., Fast algorithm for min independent dominating set.SIROCCO, Lect. Notes Comput. Sci.6058(2010) 247\u2013261.","DOI":"10.1007\/978-3-642-13284-1_20"},{"key":"R3","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP\u2013Completeness (Series of Books in the Mathematical Sciences). W.H. Freeman and Co Ltd, first edition edition (1979)."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson M.M.. Approximating the minimum maximal independence number.Inf. Process. Lett.46(1993) 169\u2013172.","DOI":"10.1016\/0020-0190(93)90022-2"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Harary F. and Livingston M., Independent domination in hypercubes.Appl. Math. Lett.6(1993) 27\u201328.","DOI":"10.1016\/0893-9659(93)90027-K"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Haviland J., Independent domination in triangle\u2013free graphs.Discrete Math.308(2008) 3545\u20133550.","DOI":"10.1016\/j.disc.2007.07.010"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Johnson D.S., Papadimitriou C.H. and Yannakakis M., On generating all maximal independent sets.Inf. Process. Lett.27(1988) 119\u2013123.","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"F. Kuhn, T. Nieberg, T. Moscibroda and R. Wattenhofer, Local approximation schemes for ad hoc and sensor networks.DIALM-POMC(2005) 97\u2013103.","DOI":"10.1145\/1080810.1080827"},{"key":"R9","unstructured":"J. Little,Branch and Bound Methods for Combinatorial Problems. Ulan Press (2012)."},{"key":"R10","unstructured":"Liu C. and Song Y., Exact algorithms for finding the minimum independent dominating set in graphs.ISAAC, Lect. Notes Comput. Sci.4288(2006) 439\u2013448."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Orlovich Y.L., Gordon V.S. and de Werra D., On the inapproximability of independent domination in 2p3\u2013free perfect graphs.Theor. Comput. Sci.410(2009) 977\u2013982.","DOI":"10.1016\/j.tcs.2008.11.023"},{"key":"R12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-642-22606-9_10","volume":"168","author":"Potluri","year":"2011","journal-title":"in Springer IC3, Commun. Comput. Inf. Sci."},{"key":"R13","unstructured":"Shiu W.C., Chen X.-G. and Chan W.H., Triangle\u2013free graphs with large independent domination number.Discrete Optim.7(2010) 86\u201392."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Y. Song, T. Liu and K. Xu, Independent domination on tree convex bipartite graphs, inFrontiers in Algorithmics and Algorithmic Aspects in Information and Management, edited by J. Snoeyink, P. Lu, K. Su and L. Wang. Springer Berlin Heidelberg,Lect. Notes Comput. Sci.7285(2012) 129\u2013138.","DOI":"10.1007\/978-3-642-29700-7_12"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"J. Steele,The Cauchy\u2013Schwarz master class: an introduction to the art of mathematical inequalities. MAA problem books series. Cambridge University Press (2004).","DOI":"10.1017\/CBO9780511817106"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2013034\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T09:24:16Z","timestamp":1563009856000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2013034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,2]]},"references-count":15,"journal-issue":{"issue":"3"},"alternative-id":["ro130034"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2013034","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,2]]}}}