Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

CPC
2007

favoriteEmaildiscussreport

68views more CPC 2007»

The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments

13 years 11 months ago

The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments

Download hal-lirmm.ccsd.cnrs.fr

Pierre Charbit, Stéphan Thomassé, An

Real-time Traffic

CPC 2007 |

claim paper

Related Content

» How to rank with few errors A PTAS for Weighted Feedback Arc Set on Tournaments

» Kernels for Feedback Arc Set In Tournaments

» Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite T...

» FixedParameter Tractability Results for Feedback Set Problems in Tournaments

» Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments

» How to rank with few errors

» Online Ranking for Tournament Graphs

» Capacity inverse minimum cost flow problem

» On Approximating an Implicit Cover Problem in Biology

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CPC
Authors	Pierre Charbit, Stéphan Thomassé, Anders Yeo

Comments (0)