Local Search Algorithms for the Vertex K-Center Problem
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Latin America Transactions"
DOI: 10.1109/tla.2018.8444397
Abstract: The vertex k-center problem is a classical NP-Hard problem with applications to Clustering and Facility Location. It has been shown that this problem cannot be solved within a ρ&2 approximation factor, unless P=NP. Although there… read more here.
Keywords: search; local search; center problem; vertex center ... See more keywords