Faster Exact and Approximate Algorithms for k-Cut

In the k-cut problem, we are given an edge-weighted graph G and an integer k, and have to remove a set of edges with minimum total weight so that G has at least k connected components. The current best algorithms are an O(n^(2-o(1))k) randomized algorithm due to Karger and Stein, and an Õ(n^2k) dete...

Full description

Bibliographic Details

Published in:	2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) pp. 113 - 123
Main Authors:	Gupta, Anupam, Lee, Euiwoong, Li, Jason
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2018
Subjects:	Approximation algorithms Color Computer science Encoding Forestry graph algorithms Heuristic algorithms minimum k-cut parameterized algorithm Runtime
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!