Fault-tolerant total domination via submodular function approximation

DOI10.1007/978-3-031-20350-3_23MaRDI QIDQ6111966zbMATH OpenFDO

Authors Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis, V. Zissimopoulos

Publication date 4 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-20350-3_23

zbMATH Keywords

approximation algorithmsdominating setsubmodular functiontotal dominationfault-tolerant

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Approximating fault-tolerant domination in general graphs
• scientific article; zbMATH DE number 7650395
• Fault tolerant subgraph for single source reachability: generic and optimal
• Fault-tolerant subgraph for single-source reachability: general and optimal
• An integer programming approach for fault-tolerant connected dominating sets
• Bounds of fault-tolerant locating-dominating sets
• Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
• A greedy algorithm for the fault-tolerant connected dominating set in a general graph
• A greedy algorithm for the fault-tolerant outer-connected dominating set problem
• Approximation algorithms for fault tolerant facility allocation

Cites work

• scientific article; zbMATH DE number 5764849 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• A greedy algorithm for the fault-tolerant connected dominating set in a general graph
• A greedy approximation for minimum connected dominating sets
• Approximating fault-tolerant domination in general graphs
• Approximation hardness of dominating set problems in bounded degree graphs
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
• Topics in Domination in Graphs
• Total domination in graphs
• Total domination in graphs

This page was built for publication: Fault-tolerant total domination via submodular function approximation

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