Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem

From MaRDI portal

(Redirected from Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem)

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=Tight_approximation_ratio_of_a_general_greedy_splitting_algorithm_for_the_minimum_%5C(k%5C)-way_cut_problem&oldid=63133410"