Efficient algorithms for the minmax regret path center problem with length constraint on trees

From MaRDI portal

(Redirected from Efficient algorithms for the minmax regret path center problem with length constraint on trees)

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=Efficient_algorithms_for_the_minmax_regret_path_center_problem_with_length_constraint_on_trees&oldid=78229979"