scientific article; zbMATH DE number 6850403
From MaRDI portal
Publication:4607983
Recommendations
- Hypergraph \(k\)-cut in randomized polynomial time
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- On the hardness of approximating the \(k\)-\textsc{Way Hypergraph Cut} problem
- Algorithms for the determination of cutsets in a hypergraph
- On the maximal cut in a random hypergraph
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
- Complexity and approximability of the \(k\)-way vertex cut
- scientific article; zbMATH DE number 1670644
- Fast and Deterministic Approximations for k-Cut.
- Fast and deterministic approximations for \(k\)-cut
Cited in
(13)- New approximations and hardness results for submodular partitioning problems
- A new contraction technique with applications to congruency-constrained cuts
- Minimum cuts and sparsification in hypergraphs
- On the hardness of approximating the \(k\)-\textsc{Way Hypergraph Cut} problem
- Hypergraph \(k\)-cut in randomized polynomial time
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs.
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Random contractions and sampling for hypergraph and hedge connectivity
- Faster connectivity in low-rank hypergraphs via expander decomposition
- Computing minimum multiway cuts in hypergraphs from hypertree packings
- Hypergraph Cuts with General Splitting Functions
- Algorithms for the determination of cutsets in a hypergraph
- LP relaxation and tree packing for minimum \(k\)-cut
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607983)
