Sciweavers

Share
IWOCA
2010
Springer

Ranking and Drawing in Subexponential Time

9 years 1 months ago
Ranking and Drawing in Subexponential Time
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimization
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov,
Added 19 May 2011
Updated 19 May 2011
Type Journal
Year 2010
Where IWOCA
Authors Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh
Comments (0)
books