A simple algorithm for the multiway cut problem
Year of publication: |
2019
|
---|---|
Authors: | Buchbinder, Niv ; Schwartz, Roy ; Weizman, Baruch |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 47.2019, 6, p. 587-593
|
Subject: | Approximation algorithms | Multiway cut | Randomized rounding | Simplex transformation | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Simplex transformations and the multiway cut problem
Buchbinder, Niv, (2021)
-
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
Asadpour, Arash, (2017)
-
Goerigk, Marc, (2023)
- More ...
-
Simplex transformations and the multiway cut problem
Buchbinder, Niv, (2021)
-
Comparing apples and oranges : query trade-off in submodular maximization
Buchbinder, Niv, (2017)
-
A refined analysis of submodular greedy
Kulik, Ariel, (2021)
- More ...