Concepedia

Two population-based optimization algorithms for minimum weight connected dominating set problem

Züleyha Akusta Dağdevıren, Muhammed Cinsdikici

Applied Soft Computing · 2017 · 33 citations · 37 references

DOI

Concepts

References

37

A Greedy Heuristic for the Set-Covering Problem

Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations

, , +17

On calculating connected dominating set for efficient routing in ad hoc wireless networks

Jie Wu, Hailan Li · 1999 · 1.2K citations · Full text

, , +16

Approximation Algorithms for Connected Dominating Sets

Suvajyoti Guha, Samir Khuller · Algorithmica · 1998 · 1.1K citations

, , +9

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

Rubén Ruíz, Thomas Stützle · European Journal of Operational Research · 2006 · 1.1K citations

, , +14

Algorithm 447: efficient algorithms for graph manipulation

John E. Hopcroft, Robert E. Tarjan · Communications of the ACM · 1973 · 977 citations · Full text

, , +11