A linear time deterministic algorithm to find a small subset that approximates the centroid

From MaRDI portal

(Redirected from A linear time deterministic algorithm to find a small subset that approximates the centroid)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_linear_time_deterministic_algorithm_to_find_a_small_subset_that_approximates_the_centroid&oldid=72650628"