Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs.

DOI10.4230/lipics.approx/random.2020.17OpenAlexW3082245614MaRDI QIDQ6084360

Karthekeyan Chandrasekaran, Calvin Beideman, Chao Xu

Publication date: 31 October 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.17

zbMATH Keywords

multiobjective optimizationhypergraph min-cuthypergraph-\k\-cut

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
• Multicriteria global minimum cuts
• Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations
• Sketching Cuts in Graphs and Hypergraphs
• Lower Bounds in a Parallel Model without Bit Operations
• A Polynomial Algorithm for the k-cut Problem for Fixed k
• Minimum Cuts and Sparsification in Hypergraphs
• Random Contractions and Sampling for Hypergraph and Hedge Connectivity
• Enumerating parametric global minimum cuts by random interleaving

This page was built for publication: Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs.