7 citations · 29 across the 31 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Improving the smoothed complexity of FLIP for max cut problems
Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
Finding locally optimal solutions for max-cut and max--cut are well-known PLS-complete problems. An instinctive approach to finding such a locally optimum solution is the FLIP m…
cs.DS2018
Improving the Integrality Gap for Multiway Cut
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király +1
In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of terminal nodes, and the goal is to partition the node set of th…