Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem

From MaRDI portal

(Redirected from Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree 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=Unconditional_lower_bounds_on_the_time-approximation_tradeoffs_for_the_distributed_minimum_spanning_tree_problem&oldid=80756396"