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

DOI10.1007/S10878-011-9396-0MaRDI QIDQ1928496zbMATH OpenOpenAlexFDO

Authors Julien Schleich, Le Thi Hoai An, 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

DC programming and DCAexact penaltyminimum dominating set

Mathematics Subject Classification ID

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

Recommendations

• D.c. optimization methods for solving minimum maximal network flow problem
• On DC optimization algorithms for solving minmax flow problems
• DCA-based algorithms for DC fitting
• Optimization based DC programming and DCA for hierarchical clustering
• DC programming and DCA for general DC programs

Cites work

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

Cited in

(6)

• Bank supervision using the threshold-minimum dominating set
• DC programming and DCA: thirty years of developments
• A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
• DC approximation approaches for sparse optimization
• DC programming and DCA for general DC programs
• A parallel difference-of-convex cutting plane algorithm for mixed-binary linear programs

Describes a project that uses

Uses Software

• GraphStream

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928496)