Domination and coverage problems under vulnerability constraints

DOI10.1007/978-3-032-27732-9_29MaRDI QIDQ7363401zbMATH OpenFDO

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

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27732-9_29

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A better approximation ratio for the vertex cover problem
• A linear-time approximation algorithm for the weighted vertex cover problem
• A note on the set union knapsack problem
• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems
• Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
• Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
• scientific article; zbMATH DE number 1629828 (Why is no real title available?)
• scientific article; zbMATH DE number 1323125 (Why is no real title available?)
• scientific article; zbMATH DE number 1445322 (Why is no real title available?)
• Improved budgeted connected domination and budgeted edge-vertex domination
• Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
• Influence maximization in the presence of vulnerable nodes: a ratio perspective
• Maximum rooted connected expansion
• Topics in Domination in Graphs

This page was built for publication: Domination and coverage problems under vulnerability constraints

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