On greedy approximation algorithm for the minimum resolving dominating set problem

DOI10.1007/S10878-024-01229-4MaRDI QIDQ7031280zbMATH OpenFDO

Authors Hao Zhong

Publication date 6 February 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

greedy approximation algorithmNP-hardnesssubmodular functionresolving dominating set

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: On greedy approximation algorithm for the minimum resolving dominating set problem

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