-Cut in Randomized Polynomial Time.

Karthekeyan Chandrasekaran Chao Xu Xilin Yu

Published in: SODA (2018)

Keyphrases

planar graphs
randomized algorithm
special case
worst case
computational complexity
neural network
expert systems
np hardness
integrality gap
privacy preserving association rule mining
databases
social networks
greedy algorithm
approximation algorithms