Simplex transformations and the multiway cut problem
Year of publication: |
2021
|
---|---|
Authors: | Buchbinder, Niv ; Schwartz, Roy ; Weizman, Baruch |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 46.2021, 2, p. 757-771
|
Subject: | multiway cut | approximation algorithms | randomized rounding | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Theorie | Theory |
-
A simple algorithm for the multiway cut problem
Buchbinder, Niv, (2019)
-
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
Asadpour, Arash, (2017)
-
Goerigk, Marc, (2023)
- More ...
-
A simple algorithm for the multiway cut problem
Buchbinder, Niv, (2019)
-
Comparing apples and oranges : query trade-off in submodular maximization
Buchbinder, Niv, (2017)
-
A refined analysis of submodular greedy
Kulik, Ariel, (2021)
- More ...