Integer linear programming formulations for double roman domination problem

DOI10.1080/10556788.2019.1679142zbMath1501.90050arXiv1902.07863OpenAlexW2982085030MaRDI QIDQ5038168

Qingqiong Cai, Neng Fan, Yongtang Shi, Shunyu Yao

Publication date: 29 September 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.07863

zbMATH Keywords

approximation algorithminteger linear programmingdouble Roman domination

Mathematics Subject Classification ID

Integer programming (90C10) Approximation algorithms (68W25)

Related Items (5)

Triple Roman domination in graphs ⋮ 3-component domination numbers in graphs ⋮ The domination number of wrapped butterfly digraphs ⋮ Linear programming formulation for some generalized domination parameters ⋮ Algorithmic complexity of weakly connected Roman domination in graphs

Uses Software

• NetworkX

Cites Work

• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Double Roman domination
• Approximation hardness of dominating set problems in bounded degree graphs
• A survey of selected recent results on total domination in graphs
• Roman domination in graphs.
• Some progress on the double Roman domination in graphs
• Mixed Roman domination in graphs
• Double Roman domination in trees
• Double Roman domination number
• Independent domination in graphs: A survey and recent results
• A new method to obtain either first- or second-order reductions for parametric polynomial ODEs
• Double Roman domination in digraphs
• On the double Roman domination of graphs
• On the double Roman domination in graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Maximal matching polytope in trees
• Extremal Problems for Roman Domination
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
• Double Roman domination and domatic numbers of graphs
• Improved mixed integer linear programing formulations for roman domination problem
• Optimal routing and resource allocation in multi-hop wireless networks
• On maximal Roman domination in graphs
• Set covering approach for reconstruction of sibling relationships
• An upper bound on the double Roman domination number
• The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)

This page was built for publication: Integer linear programming formulations for double roman domination problem