Ranking and Drawing in Subexponential Time

14 years 9 months ago

Download www.ii.uib.no

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,

Real-time Traffic

Algorithms | IWOCA 2010 | P-kemeny Aggregation | P-one-sided Crossing Minimization | Social Choice Theory |

claim paper

» Grad and classes with bounded expansion II Algorithmic aspects

» Picasso to sing you must close your eyes and draw

» Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem

» On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

» Visual Ranking of Link Structures

» Playing large games using simple strategies

» Parallelizing ListNet training using spark

» Genetic local search for multiobjective combinatorial optimization

Post Info
More Details (n/a)

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)

Sciweavers

Ranking and Drawing in Subexponential Time

Algorithms | IWOCA 2010 | P-kemeny Aggregation | P-one-sided Crossing Minimization | Social Choice Theory |

Explore & Download

Productivity Tools

Sciweavers