Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference33 articles.
1. Alpert, C., Kahng, A.: Recent developments in netlist partitioning: a survey. Integr. VLSI J. 19(1–2), 1–81 (1995)
2. Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an $$o(n^{\frac{1}{4}})$$ approximation for densest $$k$$-subgraph. In: Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, STOC ’10, pp. 201–210 (2010)
3. Chekuri, C., Ene, A.: Approximation algorithms for submodular multiway partition. In: Proceedings of the 52nd IEEE Annual Symposium on Foundations of Computer Science, FOCS ’11, pp. 807–816 (2011)
4. Chekuri, C., Li, S.: A note on the hardness of approximating the $$k$$-way hypergraph cut problem, Manuscript, http://chekuri.cs.illinois.edu/papers/hypergraph-kcut.pdf (2015)
5. Chekuri, C., Xu, C.: Computing minimum cuts in hypergraphs. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’17, pp. 1085–1100 (2017)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献