Author:
Chandrasekaran Karthekeyan,Chekuri Chandra
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference31 articles.
1. Bansal, N., Feige, U., Krauthgamer, R., Makarychev, K., Nagarajan, V., Naor, J., Schwartz, R.: Min-max graph partitioning and small set expansion. SIAM J. Comput. 43(2), 872–904 (2014)
2. Beideman, C., Chandrasekaran, K., Wang, W.: Counting and enumerating optimum cut sets for hypergraph $$k$$-partitioning problems for fixed $$k$$. In: International Colloquium on Automata, Languages and Programming, ICALP, pp. 16:1–16:18 (2022)
3. Bernáth, A., Király, Z.: On the tractability of some natural packing, covering and partitioning problems. Discret. Appl. Math. 180, 25–35 (2015)
4. Chandrasekaran, K., Chekuri, C.: Hypergraph $$k$$-cut for fixed $$k$$ in deterministic polynomial time, Mathematics of Operations Research (2022), Prelim. version in FOCS (2020)
5. Chandrasekaran, K., Xu, C., Yu, X.: Hypergraph $$k$$-Cut in randomized polynomial time. Math. Program. 186, 85–113 (2021)