An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees (scientific article; zbMATH DE number 7236476)

From MaRDI portal

(Redirected from An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees (scientific article; zbMATH DE number 7236476))

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=An_%5C(O(n%5Clog_n)%5C)-time_algorithm_for_the_%5C(k%5C)-center_problem_in_trees_(scientific_article;_zbMATH_DE_number_7236476)&oldid=94307237"