Abstract
On the Hardness of Approximating the $k$-Way Hypergraph Cut problem
Highlights
The result in this paper is on the hardness of approximating k-WAY HYPERGRAPH CUT when k is part of the input; we note that if k is a fixed constant there is a polynomial-time algorithm for k-WAY HYPERGRAPH CUT due to recent work [4, 3]
We consider the following problem.k-WAY HYPERGRAPH CUT: Let G = (V, E) be a hypergraph with edge weights given by w : E → R+
Manurangsi [12] showed that under the Exponential Time Hypothesis (ETH), DENSEST -SUBGRAPH is hard to approximate to a factor better than n1/(loglogn)c where n is the number of nodes in the input graph and c > 0 is a universal constant
Summary
The result in this paper is on the hardness of approximating k-WAY HYPERGRAPH CUT when k is part of the input; we note that if k is a fixed constant there is a polynomial-time algorithm for k-WAY HYPERGRAPH CUT due to recent work [4, 3]. ON THE HARDNESS OF APPROXIMATING THE k-WAY HYPERGRAPH CUT PROBLEM
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.