Experimental analysis of Heuristic algorithms for the dominating set problem
From MaRDI portal
Publication:1600994
DOI10.1007/s00453-001-0101-zzbMath0994.68092OpenAlexW2084507343MaRDI QIDQ1600994
Publication date: 17 June 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0101-z
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) General topics in the theory of software (68N01)
Related Items (10)
Experiments on data reduction for optimal domination in networks ⋮ A heuristic approximation algorithm of minimum dominating set based on rough set theory ⋮ A Rough-Set Based Solution of the Total Domination Problem ⋮ Heuristics for \(k\)-domination models of facility location problems in street networks ⋮ An iterated greedy algorithm for finding the minimum dominating set in graphs ⋮ Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis ⋮ Computational study on a PTAS for planar dominating set problem ⋮ Data Exploration by Representative Region Selection: Axioms and Convergence ⋮ Computational study on planar dominating set problem ⋮ An order-based algorithm for minimum dominating set with application in graph mining
This page was built for publication: Experimental analysis of Heuristic algorithms for the dominating set problem
