A Greedy Algorithm for Minimum Cut into Bounded Sets Problem.

Onur Ugurlu Vahid Khalilpour Akram Deniz Türsel Eliiyi

Published in: CNSM (2021)

Keyphrases

greedy algorithm
minimum cut
maximum flow
greedy algorithms
graph cuts
dynamic programming
worst case
greedy strategy
objective function
weighted graph
shortest path problem
greedy heuristic
randomized algorithm
knapsack problem
shortest path
influence spread
normalized cut
optimization problems