热门出版物 - 学术资源搜索

引用“”的文章LP Relaxation and Tree Packing for Minimum k-Cut

标题/作者	年份
Hypergraph k-cut in randomized polynomial time K Chandrasekaran, C Xu, X Yu Mathematical Programming 186, 85-113	2021
A parameterized approximation scheme for min k-cut D Lokshtanov, S Saurabh, V Surianarayanan SIAM Journal on Computing, FOCS20-205-FOCS20-238	2022
Minimum cut and minimum k-cut in hypergraphs via branching contractions K Fox, D Panigrahi, F Zhang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …	2019
The Karger-Stein algorithm is optimal for k-cut A Gupta, E Lee, J Li Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …	2020
Hypergraph k-cut for fixed k in deterministic polynomial time K Chandrasekaran, C Chekuri Mathematics of Operations Research 47 (4), 3380-3399	2022
Faster minimum k-cut of a simple graph J Li 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …	2019
The number of minimum k-cuts: Improving the karger-stein bound A Gupta, E Lee, J Li Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …	2019
Min–max partitioning of hypergraphs and symmetric submodular functions K Chandrasekaran, C Chekuri Combinatorica 43 (3), 455-477	2023
Optimal bounds for the k-cut problem A Gupta, DG Harris, E Lee, J Li ACM Journal of the ACM (JACM) 69 (1), 1-18	2021
Fast and Deterministic Approximations for $ k $-Cut K Quanrud arXiv preprint arXiv:1807.07143	2018
On the hardness of approximating the k-way hypergraph cut problem C Chekuri, S Li Theory of Computing 16 (1)	2020
A note on the hardness of approximating the k-way Hypergraph Cut problem C Chekuri, S Li Manuscript, http://chekuri. cs. illinois. edu/papers/hypergraph-kcut. pdf	2015
Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k C Beideman, K Chandrasekaran, W Wang Mathematics of Operations Research	2023
Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k∗ C Beideman, K Chandrasekaran, W Wang Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …	2022
Fast approximations for combinatorial optimization via multiplicative weight updates K Quanrud University of Illinois at Urbana-Champaign	2019
Convergence to lexicographically optimal base in a (contra) polymatroid and applications to densest subgraph and tree packing E Harb, K Quanrud, C Chekuri arXiv preprint arXiv:2305.02987	2023
Packing Hypertrees and the k-cut problem in Hypergraphs M Baïou, F Barahona International Conference on Learning and Intelligent Optimization, 521-534	2022
Fixed parameter approximation scheme for min-max k-cut K Chandrasekaran, W Wang Mathematical Programming 197 (2), 1093-1144	2023
Minimum violation vertex maps and their applications to cut problems K Kawarabayashi, C Xu SIAM Journal on Discrete Mathematics 34 (4), 2183-2207	2020
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions K Fox, D Panigrahi, F Zhang ACM Transactions on Algorithms 19 (2), 1-22	2023

1 - 20

计算机程序会自动估算并确定日期和引用次数。