On parallelizing a greedy heuristic for finding small dominant sets
From MaRDI portal
Recommendations
- Analysis of a greedy heuristic for finding small dominating sets in graphs
- Parallel and serial heuristics for the minimum set cover problem
- scientific article; zbMATH DE number 177834
- scientific article; zbMATH DE number 1163099
- Parallelizing greedy for submodular set function maximization in matroids and beyond
- On greedy heuristics for computing D-efficient saturated subsets
- An efficient distributed algorithm for constructing small dominating sets
- A parallel, linear programming-based heuristic for large-scale set partitioning problems
- A unified greedy approximation for several dominating set problems
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- A taxonomy of problems with fast parallel algorithms
- Analysis of a greedy heuristic for finding small dominating sets in graphs
- Approximation algorithms for combinatorial problems
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Depth-first search is inherently sequential
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- Ordered vertex removal and subgraph problems
- Parallelism and the maximal path problem
Cited in
(2)
This page was built for publication: On parallelizing a greedy heuristic for finding small dominant sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366651)
