{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T14:12:13Z","timestamp":1763388733275},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,5,3]],"date-time":"2011-05-03T00:00:00Z","timestamp":1304380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s10878-011-9396-0","type":"journal-article","created":{"date-parts":[[2011,5,2]],"date-time":"2011-05-02T21:47:08Z","timestamp":1304372828000},"page":"397-412","source":"Crossref","is-referenced-by-count":14,"title":["Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA"],"prefix":"10.1007","volume":"24","author":[{"given":"Julien","family":"Schleich","sequence":"first","affiliation":[]},{"given":"Hoai An","family":"Le Thi","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Bouvry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,3]]},"reference":[{"issue":"4","key":"9396_CR1","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/TPDS.2006.52","volume":"17","author":"S Basagni","year":"2006","unstructured":"Basagni S, Mastrogiovanni M, Panconesi A, Petrioli C (2006) Localized protocols for ad hoc clustering and backbone formation: A performance comparison. IEEE Trans Parallel Distrib Syst 17(4):292\u2013306","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"9396_CR2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.11650\/twjm\/1500602498","volume":"12","author":"B Bre\u0161ar","year":"2008","unstructured":"Bre\u0161ar B, Henning MA, Rall DF (2008) Rainbow domination in graphs. Taiwan J Math 12:213\u2013225","journal-title":"Taiwan J Math"},{"key":"9396_CR3","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.tcs.2008.11.015","volume":"410","author":"D Dai","year":"2009","unstructured":"Dai D, Yu C (2009) A 5+\u03f5-approximation algorithm for minimum weighted dominating set in unit disk graph. Theor Comput Sci 410:756\u2013765","journal-title":"Theor Comput Sci"},{"issue":"10","key":"9396_CR4","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/TPDS.2004.48","volume":"15","author":"F Dai","year":"2004","unstructured":"Dai F, Wu J (2004) An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Trans Parallel Distrib Syst 15(10):908\u2013920","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"9396_CR5","volume-title":"EPNACS: Emergent properties in natural and artificial complex systems","author":"A Dutot","year":"2007","unstructured":"Dutot A, Guinand F, Olivier D, Pign\u00e9 Y (2007) Graphstream: A tool for bridging the gap between complex systems and dynamic graphs. In: EPNACS: Emergent properties in natural and artificial complex systems"},{"key":"9396_CR6","first-page":"290","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs. Publ Math 6:290\u2013297","journal-title":"Publ Math"},{"key":"9396_CR7","series-title":"Lecture notes in computer science","first-page":"245","volume-title":"Graph-theoretic concepts in computer science","author":"FV Fomin","year":"2005","unstructured":"Fomin FV, Kratsch D, Woeginger GJ (2005) Exact (exponential) algorithms for the dominating set problem. In: Graph-theoretic concepts in computer science. Lecture notes in computer science, vol 3353. Springer, Berlin, pp\u00a0245\u2013256"},{"key":"9396_CR8","volume-title":"Computers and intractability; A guide to the theory of NP-completeness","author":"M Garey","year":"1990","unstructured":"Garey M, Johnson DS (1990) Computers and intractability; A guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9396_CR9","first-page":"148","volume-title":"Proceedings of SWAT","author":"S Gaspers","year":"2006","unstructured":"Gaspers S, Kratsch D, Liedloff M (2006) Exponential time algorithms for the minimum dominating set problem. In: Proceedings of SWAT, vol\u00a04059, pp\u00a0148\u2013159"},{"issue":"4","key":"9396_CR10","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374\u2013387","journal-title":"Algorithmica"},{"key":"9396_CR11","first-page":"201","volume":"50","author":"F Harary","year":"2000","unstructured":"Harary F, Haynes TW (2000) Double domination in graphs. Ars Comb 50:201\u2013213","journal-title":"Ars Comb"},{"issue":"1\u20133","key":"9396_CR12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(90)90365-O","volume":"86","author":"ST Hedetniemi","year":"1990","unstructured":"Hedetniemi ST, Laskar RC (1990) Bibliography on domination in graphs and some basic definitions of domination parameters. Discrete Math 86(1\u20133):257\u2013277","journal-title":"Discrete Math"},{"key":"9396_CR13","doi-asserted-by":"crossref","first-page":"5122","DOI":"10.1016\/j.tcs.2009.08.011","volume":"410","author":"SM Khamis","year":"2009","unstructured":"Khamis SM, Daoud SS, Essa HAE (2009) A randomized algorithm for determining dominating set in graphs of maximum degree five. Theor Comput Sci 410:5122\u20135127","journal-title":"Theor Comput Sci"},{"issue":"3","key":"9396_CR14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"HA Le Thi","year":"1997","unstructured":"Le Thi HA, Pham Dinh T (1997) Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J Glob Optim 11(3):253\u2013285","journal-title":"J Glob Optim"},{"issue":"1","key":"9396_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/S1052623498342794","volume":"14","author":"HA Le Thi","year":"2003","unstructured":"Le Thi HA, Pham Dinh T (2003) Large scale molecular optimization from distances matrices by a dc optimization approach. SIAM J Optim 14(1):77\u2013116","journal-title":"SIAM J Optim"},{"issue":"1\u20134","key":"9396_CR16","first-page":"23","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"Le Thi HA, Pham Dihn T (2005) The dc (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann Oper Res 133(1\u20134):23\u201346","journal-title":"Ann Oper Res"},{"issue":"2","key":"9396_CR17","first-page":"169","volume":"27","author":"HA Le Thi","year":"1999","unstructured":"Le Thi HA, Pham Dinh T, Le Dung M (1999) Exact penalty in DC programming. Vietnam J Math 27(2):169\u2013178","journal-title":"Vietnam J Math"},{"issue":"1","key":"9396_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0020-0190(03)00233-3","volume":"87","author":"CS Liao","year":"2003","unstructured":"Liao CS, Chang GJ (2003) k-tuple domination in graphs. Inf Process Lett 87(1):45\u201350","journal-title":"Inf Process Lett"},{"key":"9396_CR19","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.ipl.2008.02.009","volume":"107","author":"M Liedloff","year":"2008","unstructured":"Liedloff M (2008) Finding a dominating set on bipartite graphs. Inf Process Lett 107:154\u2013157","journal-title":"Inf Process Lett"},{"issue":"1","key":"9396_CR20","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh T, Le Thi HA (1997) Convex analysis approach to DC programming: Theory algorithms and applications. Acta Math Vietnam 22(1):289\u2013355","journal-title":"Acta Math Vietnam"},{"key":"9396_CR21","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"Dinh T Pham Dinh","year":"1998","unstructured":"Pham Dinh Dinh T, Le Thi HA (1998) DC optimization algorithms for solving the trust region subproblem. SIAM J Optim 8:476\u2013505","journal-title":"SIAM J Optim"},{"issue":"5","key":"9396_CR22","first-page":"377","volume":"23","author":"E Sampathkumar","year":"1983","unstructured":"Sampathkumar E (1983) The global domination number of a graph. J Math Phys Sci 23(5):377\u2013385","journal-title":"J Math Phys Sci"},{"key":"9396_CR23","first-page":"657","volume-title":"Proceedings of STACS","author":"JMM Rooij van","year":"2008","unstructured":"van Rooij JMM, Bodlaender HL (2008) Design by measure and conquer: A faster exact algorithm for dominating set. In: Proceedings of STACS, pp\u00a0657\u2013668"},{"key":"9396_CR24","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial optimization\u2014eureka! You shrink!","author":"GJ Woeginger","year":"2003","unstructured":"Woeginger GJ (2003) Exact algorithms for NP-hard problems: A survey. In: J\u00fcnger M, Reinelt G, Rinaldi G (eds) Combinatorial optimization\u2014eureka! You shrink! LNCS, vol 2570. Springer, Berlin, pp\u00a0185\u2013207"},{"key":"9396_CR25","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/313239.313261","volume-title":"Proc third ACM int\u2019l workshop discrete algorithms and methods for mobile computing and comm dial M","author":"J Wu","year":"1999","unstructured":"Wu J, Li H (1999) On calculating connected dominating sets for efficient routing in ad hoc wireless networks. In: Proc third ACM int\u2019l workshop discrete algorithms and methods for mobile computing and comm dial M, pp\u00a07\u201317"},{"key":"9396_CR26","series-title":"LNCS","first-page":"1393","volume-title":"Networking","author":"J Wu","year":"2005","unstructured":"Wu J, Cardei M, Dai F, Yang S (2005) Extended dominating set in ah hoc networks using cooperative communication. In: Networking. LNCS, vol 3462, pp\u00a01393\u20131396"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9396-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9396-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9396-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T12:51:08Z","timestamp":1560171068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9396-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,3]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["9396"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9396-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,3]]}}}