Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Sagi Hed"'
Publikováno v:
Theory of Computing Systems. 61:987-1010
We consider combinatorial algorithms for the minimum-cost flow problem on networks with unit capacities, and special cases of the problem. Historically, researchers have developed special-purpose algorithms that exploit unit capacities. In contrast,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f03fe6d80c537f644117f3493be8bc3
https://doi.org/10.1007/s00224-017-9776-7
https://doi.org/10.1007/s00224-017-9776-7
Autor:
Renato F. Werneck, Haim Kaplan, Andrew V. Goldberg, Pushmeet Kohli, Robert E. Tarjan, Sagi Hed
Publikováno v:
Algorithms-ESA 2015 ISBN: 9783662483497
ESA
ESA
We introduce the Excesses Incremental Breadth-First Search (Excesses IBFS) algorithm for maximum flow problems. We show that Excesses IBFS has the best overall practical performance on real-world instances, while maintaining the same polynomial runni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef53a977406206503693ebb21c19d7ae
https://doi.org/10.1007/978-3-662-48350-3_52
https://doi.org/10.1007/978-3-662-48350-3_52
Publikováno v:
Algorithms – ESA 2011 ISBN: 9783642237188
ESA
ESA
Maximum flow and minimum s-t cut algorithms are used to solve several fundamental problems in computer vision. These problems have special structure, and standard techniques perform worse than the special-purpose Boykov-Kolmogorov (BK) algorithm. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10ec81b3f860dd337aac1924fec29dfa
https://doi.org/10.1007/978-3-642-23719-5_39
https://doi.org/10.1007/978-3-642-23719-5_39