Fault-tolerant total domination via submodular function approximation

DOI10.1007/978-3-031-20350-3_23MaRDI QIDQ6111966

Ioannis Sigalas, Ioannis Vaxevanakis, Vassilios Zissimopoulos, Ioannis Lamprou

Publication date: 4 August 2023

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

zbMATH Keywords

submodular functiondominating setapproximation algorithmstotal dominationfault-tolerant

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A greedy algorithm for the fault-tolerant connected dominating set in a general graph
• A greedy approximation for minimum connected dominating sets
• Approximation hardness of dominating set problems in bounded degree graphs
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• Total domination in graphs
• Total Domination in Graphs
• Topics in Domination in Graphs
• TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
• Approximating Fault-Tolerant Domination in General Graphs

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