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...

Celý popis

Podrobná bibliografia

Vydané v:	2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) s. 113 - 123
Hlavní autori:	Gupta, Anupam, Lee, Euiwoong, Li, Jason
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2018
Predmet:	Approximation algorithms Color Computer science Encoding Forestry graph algorithms Heuristic algorithms minimum k-cut parameterized algorithm Runtime
ISSN:	2575-8454
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!