A polynomial time algorithm for finding a minimum 4-partition of a submodular function

Cites Work

Unnamed Item
Unnamed Item
Finding minimum 3-way cuts in hypergraphs
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
Minimizing symmetric submodular functions
On the complexity of constructing evolutionary trees
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
A fast algorithm for computing minimum 3-way and 4-way cuts
Greedy splitting algorithms for approximating multiway partition problems
Computing minimum multiway cuts in hypergraphs
On generalized greedy splitting algorithms for multiway partition problems
Hypergraph $k$-cut in randomized polynomial time
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
Multicriteria cuts and size-constrained $k$-cuts in hypergraphs
A fast hypergraph min-cut algorithm for circuit partitioning
LP Relaxation and Tree Packing for Minimum $k$-Cut
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
A Polynomial Algorithm for the k-cut Problem for Fixed k
Minimum Cuts and Sparsification in Hypergraphs
Optimal Bounds for the k -cut Problem
Suboptimal cuts: Their enumeration, weight and number
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions
A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
Approximation Algorithms for Submodular Multiway Partition
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
A polynomial time algorithm for finding a minimum 4-partition of a submodular function
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$

This page was built for publication: A polynomial time algorithm for finding a minimum 4-partition of a submodular function