TY - GEN

T1 - Fast FAST

AU - Alon, Noga

AU - Lokshtanov, Daniel

AU - Saurabh, Saket

PY - 2009/11/12

Y1 - 2009/11/12

N2 - We present a randomized subexponential time, polynomial space parameterized algorithm for the k -Weighted Feedback Arc Set in Tournaments (k -FAST) problem. We also show that our algorithm can be derandomized by slightly increasing the running time. To derandomize our algorithm we construct a new kind of universal hash functions, that we coin universal coloring families. For integers m,k and r, a family of functions from [m] to [r] is called a universal (m,k,r)-coloring family if for any graph G on the set of vertices [m] with at most k edges, there exists an which is a proper vertex coloring of G. Our algorithm is the first non-trivial subexponential time parameterized algorithm outside the framework of bidimensionality.

AB - We present a randomized subexponential time, polynomial space parameterized algorithm for the k -Weighted Feedback Arc Set in Tournaments (k -FAST) problem. We also show that our algorithm can be derandomized by slightly increasing the running time. To derandomize our algorithm we construct a new kind of universal hash functions, that we coin universal coloring families. For integers m,k and r, a family of functions from [m] to [r] is called a universal (m,k,r)-coloring family if for any graph G on the set of vertices [m] with at most k edges, there exists an which is a proper vertex coloring of G. Our algorithm is the first non-trivial subexponential time parameterized algorithm outside the framework of bidimensionality.

UR - http://www.scopus.com/inward/record.url?scp=70350583551&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350583551&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02927-1_6

DO - 10.1007/978-3-642-02927-1_6

M3 - Conference contribution

AN - SCOPUS:70350583551

SN - 3642029264

SN - 9783642029264

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 49

EP - 58

BT - Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings

T2 - 36th International Colloquium on Automata, Languages and Programming, ICALP 2009

Y2 - 5 July 2009 through 12 July 2009

ER -