An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems

From MaRDI portal

(Redirected from Publication:2354294)

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_improved_semidefinite_programming_hierarchies_rounding_approximation_algorithm_for_maximum_graph_bisection_problems&oldid=72583443"