## Local Search Algorithms for the Vertex K-Center Problem

- Jesus Garcia Diaz, Ricardo Menchaca Mendez, Jairo Sanchez Hernandez, Rolando Menchaca Mendez
- IEEE Latin America Transactions
- 2018

Highly Influenced

@article{Mihelic2005SolvingTK, title={Solving the k-center Problem Efficiently with a Dominating Set Algorithm}, author={Jurij Mihelic and Borut Robic}, journal={CIT}, year={2005}, volume={13}, pages={225-234} }

- Published 2005 in CIT

We present a polynomial time heuristic algorithm for the minimum dominating set problem. The algorithm can readily be used for solving the minimum α-all-neighbor dominating set problem and the minimum set cover problem. We apply the algorithm in heuristic solving the minimum k-center problem in polynomial time. Using a standard set of 40 test problems we experimentally show that our k-center algorithm performs much better than other well-known heuristics and is competitive with the best known… CONTINUE READING

11 Citations

14 References

Similar Papers