Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
- 3 May 2011
- journal article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 24 (4) , 397-412
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A randomized algorithm for determining dominating sets in graphs of maximum degree fiveTheoretical Computer Science, 2009
- A-approximation algorithm for minimum weighted dominating set in unit disk graphTheoretical Computer Science, 2009
- Finding a dominating set on bipartite graphsInformation Processing Letters, 2008
- Localized protocols for ad hoc clustering and backbone formation: a performance comparisonIEEE Transactions on Parallel and Distributed Systems, 2006
- An extended localized algorithm for connected dominating set formation in ad hoc wireless networksIEEE Transactions on Parallel and Distributed Systems, 2004
- k-tuple domination in graphsInformation Processing Letters, 2003
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization ApproachSIAM Journal on Optimization, 2003
- Approximation Algorithms for Connected Dominating SetsAlgorithmica, 1998
- Solving a Class of Linearly Constrained Indefinite Quadratic Problems by D.C. AlgorithmsJournal of Global Optimization, 1997
- Bibliography on domination in graphs and some basic definitions of domination parametersDiscrete Mathematics, 1990