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

Cites Work

Minimizing symmetric submodular functions
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
A Polynomial Algorithm for the k-cut Problem for Fixed k
On the complexity of constructing evolutionary trees
Greedy splitting algorithms for approximating multiway partition problems
A fast algorithm for computing minimum 3-way and 4-way cuts
On generalized greedy splitting algorithms for multiway partition problems
Title not available (Why is that?)
A fast hypergraph min-cut algorithm for circuit partitioning
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
Finding minimum 3-way cuts in hypergraphs
Hypergraph \(k\)-cut in randomized polynomial time
Minimum cuts and sparsification in hypergraphs
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
Suboptimal cuts: their enumeration, weight and number (extended abstract)
Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs
LP relaxation and tree packing for minimum \(k\)-cut
Computing minimum multiway cuts in hypergraphs
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
Approximation Algorithms for Submodular Multiway Partition
Minimum cut and minimum \(k\)-cut in hypergraphs via branching contractions
Optimal Bounds for the k -cut Problem
Title not available (Why is that?)
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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608049)