摘要：We are studying a weighted version of a linear extension problem, given some finite partial order Ï, called Completion of an Ordering. While this problem is NP-complete, we show that it lies in FPT when parameterized by the interval width of Ï. This ordering problem can be used to model several ordering problems stemming from diverse application areas, such as graph drawing, computational social choice, or computer memory management. Each application yields a special Ï. We also relate the interval width of Ï to parameterizations such as maximum range that have been introduced earlier in these applications, sometimes improving on parameterized algorithms that have been developed for these parameterizations before. This approach also gives some practical sub-exponential time algorithms for ordering problems.
关键词：Parameterized algorithms; interval width; linear extension; one-sided crossing minimization; Kemeny rank aggregation; grouping by swapping
