scientific article; zbMATH DE number 6850403
From MaRDI portal
Publication:4607983
zbMATH Open1403.68152MaRDI QIDQ4607983FDOQ4607983
Xilin Yu, Chao Xu, Karthekeyan Chandrasekaran
Publication date: 15 March 2018
Full work available at URL: http://dl.acm.org/citation.cfm?id=3175399
Title of this publication is not available (Why is that?)
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.
- scientific article; zbMATH DE number 7528583
Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Analysis of algorithms (68W40) Hypergraphs (05C65)
Cited In (9)
- New approximations and hardness results for submodular partitioning problems
- A new contraction technique with applications to congruency-constrained cuts
- LP Relaxation and Tree Packing for Minimum $k$-Cut
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs.
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Faster connectivity in low-rank hypergraphs via expander decomposition
- Minimum Cuts and Sparsification in Hypergraphs
- Hypergraph Cuts with General Splitting Functions
- Algorithms for the determination of cutsets in a hypergraph
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)
