Feedback arc set (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Feedback arc set" in French language version.

refsWebsite

Global rank French rank

8doi.org

2^nd place

3^rd place

2kth.se

low place

2ams.org

451^st place

1,058^th place

1huji.ac.il

3,903^rd place

6,566^th place

1acm.org

1,185^th place

1,318^th place

1brown.edu

2,481^st place

3,695^th place

acm.org

dl.acm.org

B. Berger et P. Shor, « Approximation algorithms for the maximum acyclic subgraph problem », dans Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA’90), 1990 (lire en ligne), p. 236–243.

ams.org

G. Even, J. Naor, B. Schieber et M. Sudan, « Approximating minimum feedback sets and multicuts in directed graphs », Algorithmica, vol. 20, n^o 2,‎ 1998, p. 151–174 (DOI 10.1007/PL00009191, MR 1484534).
Claire Kenyon-Mathieu et Warren Schudy, « How to rank with few errors: a PTAS for weighted feedback arc set on tournaments », dans Proc. 39th ACM Symposium on Theory of Computing (STOC '07), 2007 (DOI 10.1145/1250790.1250806, MR 2402432), p. 95–103. Voir aussi la version détailée.

brown.edu

cs.brown.edu

Claire Kenyon-Mathieu et Warren Schudy, « How to rank with few errors: a PTAS for weighted feedback arc set on tournaments », dans Proc. 39th ACM Symposium on Theory of Computing (STOC '07), 2007 (DOI 10.1145/1250790.1250806, MR 2402432), p. 95–103. Voir aussi la version détailée.

doi.org

dx.doi.org

Oliver Bastert, Christian Matuszewski, Michael Kaufmann et Dorothea Wagner, « Layered drawings of digraphs », dans Drawing Graphs: Methods and Models, vol. 2025, Springer-Verlag, coll. « Lecture Notes in Computer Science », 2001 (DOI 10.1007/3-540-44969-8_5), p. 87–120.
Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan et Igor Razgon, « A fixed-parameter algorithm for the directed feedback vertex set problem », Journal of the ACM, vol. 55, n^o 5,‎ 2008 (DOI 10.1145/1411509.1411511).
Irit Dinur et Samuel Safra, « On the hardness of approximating minimum vertex cover », Annals of Mathematics, vol. 162, n^o 1,‎ 2005, p. 439–485 (DOI 10.4007/annals.2005.162.439, lire en ligne).
G. Even, J. Naor, B. Schieber et M. Sudan, « Approximating minimum feedback sets and multicuts in directed graphs », Algorithmica, vol. 20, n^o 2,‎ 1998, p. 151–174 (DOI 10.1007/PL00009191, MR 1484534).
P. Eades, X. Lin et W. F. Smyth, « A fast and eﬀective heuristic for the feedback arc set problem », Information Processing Letters, vol. 47,‎ 1993, p. 319–323 (DOI 10.1016/0020-0190(93)90079-O).
Claire Kenyon-Mathieu et Warren Schudy, « How to rank with few errors: a PTAS for weighted feedback arc set on tournaments », dans Proc. 39th ACM Symposium on Theory of Computing (STOC '07), 2007 (DOI 10.1145/1250790.1250806, MR 2402432), p. 95–103. Voir aussi la version détailée.
M. Karpinski et W. Schudy, « Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament », dans Proc. 21st ISAAC (2010), vol. 6506, coll. « Lecture Notes in Computer Science », 2010, 3–14 p. (DOI 10.1007/978-3-642-17517-6_3).
Refael Hassin et Shlomi Rubinstein, « Approximations for the maximum acyclic subgraph problem », Information Processing Letters, vol. 51, n^o 3,‎ 1994, p. 133–140 (DOI 10.1016/0020-0190(94)00086-7)

huji.ac.il

cs.huji.ac.il

Irit Dinur et Samuel Safra, « On the hardness of approximating minimum vertex cover », Annals of Mathematics, vol. 162, n^o 1,‎ 2005, p. 439–485 (DOI 10.4007/annals.2005.162.439, lire en ligne).

kth.se

nada.kth.se

Viggo Kann, On the Approximability of NP-complete Optimization Problems (Ph.D. thesis), Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, 1992 (lire en ligne).
Pierluigi Crescenzi, Viggo Kann, Magnús Halldórsson, Marek Karpinski et Gerhard Woeginger, « Minimum Feedback Arc Set », dans A compendium of NP optimization problems, 2000 (lire en ligne).