Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination

DOI10.1007/978-3-030-48966-3_28OpenAlexW3030069024MaRDI QIDQ5041206

Ioannis Lamprou, Ioannis Sigalas, Vassilios Zissimopoulos

Publication date: 13 October 2022

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

Full work available at URL: https://doi.org/10.1007/978-3-030-48966-3_28

zbMATH Keywords

approximationbudgetpartialedge-vertex dominationconnected domination

Mathematics Subject Classification ID

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

Related Items (1)

Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved performance of the greedy algorithm for partial cover
• Connected dominating set. Theory and applications
• The algorithmic complexity of mixed domination in graphs
• Approximation algorithms for connected dominating sets
• The budgeted maximum coverage problem
• An improved upper bound of edge-vertex domination number of a tree
• On the mixed domination problem in graphs
• Eternally dominating large grids
• Coverage problems in sensor networks
• Bin Packing with Colocations
• Minimum Edge Dominating Sets
• A threshold of ln n for approximating set cover
• Saving an epsilon
• Edge Dominating Sets in Graphs
• Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems
• Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
• Vertex-edge domination in graphs

This page was built for publication: Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination