When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem

Jesus Garcia-Diaz (), Jairo Sanchez-Hernandez (), Ricardo Menchaca-Mendez () and Rolando Menchaca-Mendez ()
Additional contact information
Jesus Garcia-Diaz: Instituto Politécnico Nacional
Jairo Sanchez-Hernandez: Instituto Politécnico Nacional
Ricardo Menchaca-Mendez: Instituto Politécnico Nacional
Rolando Menchaca-Mendez: Instituto Politécnico Nacional

Journal of Heuristics, 2017, vol. 23, issue 5, No 3, 349-366

Abstract: Abstract The vertex k-center selection problem is a well known NP-Hard minimization problem that can not be solved in polynomial time within a $$\rho

Keywords: k-Center problem; Approximation algorithm; Dominating set; Polynomial time heuristic (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10732-017-9345-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:23:y:2017:i:5:d:10.1007_s10732-017-9345-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-017-9345-x

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().