Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA

DOI10.1007/s10878-011-9396-0zbMath1261.90082OpenAlexW1975081448MaRDI QIDQ1928496

Hoai An Le Thi, Julien Schleich, Pascal Bouvry

Publication date: 3 January 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9396-0

zbMATH Keywords

exact penaltyDC programming and DCAminimum dominating set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26)

Related Items (5)

Bank supervision using the threshold-minimum dominating set ⋮ DC approximation approaches for sparse optimization ⋮ DC Programming and DCA for General DC Programs ⋮ A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model ⋮ DC programming and DCA: thirty years of developments

Uses Software

• GraphStream

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Rainbow domination in graphs
• Finding a dominating set on bipartite graphs
• A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
• \(k\)-tuple domination in graphs
• A randomized algorithm for determining dominating sets in graphs of maximum degree five
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Approximation algorithms for connected dominating sets
• Exact penalty in d. c. programming
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes

This page was built for publication: Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA