An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks

From MaRDI portal

(Redirected from An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks)

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%5E2%5Clog%5E2_n)%5C)_time_algorithm_for_minmax_regret_minsum_sink_on_path_networks&oldid=94276556"