Pages that link to "Item:Q1887049"
From MaRDI portal
The following pages link to On generalized greedy splitting algorithms for multiway partition problems (Q1887049):
Displaying 6 items.
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
- (Q2766993) (← links)
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function (Q6608049) (← links)