A polynomial time algorithm for finding a minimum 4-partition of a submodular function
From MaRDI portal
Publication:6608049
Recommendations
- Min-max partitioning of hypergraphs and symmetric submodular functions
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
- Approximating submodular \(k\)-partition via principal partition sequence
Cites work
- scientific article; zbMATH DE number 5485527 (Why is no real title available?)
- scientific article; zbMATH DE number 7788402 (Why is no real title available?)
- A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- A fast algorithm for computing minimum 3-way and 4-way cuts
- A fast hypergraph min-cut algorithm for circuit partitioning
- A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function
- An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
- Approximation Algorithms for Submodular Multiway Partition
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Computing minimum multiway cuts in hypergraphs
- Counting and enumerating optimum cut sets for hypergraph \(k\)-partitioning problems for fixed \(k\)
- Deterministic enumeration of all minimum \(k\)-cut-sets in hypergraphs for fixed \(k\)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
- Finding minimum 3-way cuts in hypergraphs
- Greedy splitting algorithms for approximating multiway partition problems
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- Hypergraph \(k\)-cut in randomized polynomial time
- LP relaxation and tree packing for minimum \(k\)-cut
- Minimizing symmetric submodular functions
- Minimum cut and minimum \(k\)-cut in hypergraphs via branching contractions
- Minimum cuts and sparsification in hypergraphs
- Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs
- On generalized greedy splitting algorithms for multiway partition problems
- On the complexity of constructing evolutionary trees
- Optimal Bounds for the k -cut Problem
- Suboptimal cuts: their enumeration, weight and number (extended abstract)
Cited in
(2)
This page was built for publication: A polynomial time algorithm for finding a minimum 4-partition of a submodular function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608049)
