Author:
Buchbinder Niv,Schwartz Roy,Weizman Baruch
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference30 articles.
1. Haris Angelidakis, Yury Makarychev, Pasin Manurangsi, An improved integrality gap for the Călinescu-Karloff-Rabani relaxation for multiway cut, in: Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO, 2017, Waterloo, on, Canada, June 26-28, 2017, Proceedings, 2017, pp. 39–50.
2. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems;Arora,1995
3. Expander flows, geometric embeddings and graph partitioning;Arora;J. ACM,2009
4. An O(logk) approximate min-cut max-flow theorem and approximation algorithm;Aumann;SIAM J. Comput.,1998
5. Global and fixed-terminal cuts in digraphs;Bérczi;CoRR,2016
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time;Mathematics of Operations Research;2022-11
2. The metric relaxation for
0
-extension admits an
Ω(log
2/3
k)
gap;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
3. Hypergraph -cut for fixed in deterministic polynomial time;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11