Pages that link to "Item:Q1600994"
From MaRDI portal
The following pages link to Experimental analysis of Heuristic algorithms for the dominating set problem (Q1600994):
Displaying 14 items.
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
- Experiments on data reduction for optimal domination in networks (Q863574) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Analysis of a greedy heuristic for finding small dominating sets in graphs (Q1183397) (← links)
- Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
- Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem (Q1772870) (← links)
- A heuristic approximation algorithm of minimum dominating set based on rough set theory (Q2168768) (← links)
- Heuristics for \(k\)-domination models of facility location problems in street networks (Q2668796) (← links)
- Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis (Q2988810) (← links)
- (Q2998795) (← links)
- Data Exploration by Representative Region Selection: Axioms and Convergence (Q4958552) (← links)
- A Rough-Set Based Solution of the Total Domination Problem (Q5082211) (← links)
- An iterated greedy algorithm for finding the minimum dominating set in graphs (Q6102924) (← links)
- A hybrid population-based algorithm for solving the minimum dominating set problem (Q6617729) (← links)