The following pages link to (Q4828991):
Displaying 4 items.
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Minimum cost subpartitions in graphs (Q845968) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Dynamic evolution of economically preferred facilities (Q954890) (← links)
