András Sebő (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "András Sebő" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

3semanticscholar.org

11^th place

8^th place

2grenoble-inp.fr

low place

low place

69^th place

59^th place

5,814^th place

7,639^th place

7,917^th place

low place

179^th place

183^rd place

193^rd place

152^nd place

low place

low place

arxiv.org

Sebő, András; Vygen, Jens (2014-07-03). "Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs". Combinatorica. 34 (5): 597–629. arXiv:1201.1870. doi:10.1007/s00493-011-2960-3. S2CID 189904526.
Sebő, András (2013-03-18). "Eight-Fifth Approximation for the Path TSP". Eight-Fifth Approximation for the Path TSP - Springer. Lecture Notes in Computer Science. Vol. 7801. Link.springer.com. pp. 362–374. arXiv:1209.3523. doi:10.1007/978-3-642-36694-9_31. ISBN 978-3-642-36693-2. S2CID 118031668.

doi.org

Sebő, András; Vygen, Jens (2014-07-03). "Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs". Combinatorica. 34 (5): 597–629. arXiv:1201.1870. doi:10.1007/s00493-011-2960-3. S2CID 189904526.
Harald Frater (2014). "scinexx | Rekord bei mathematischer Rundreise: Neuer Algorithmus verbessert Annäherung an das Handlungsreisenden-Problem". Combinatorica. 34 (5): 597–629. doi:10.1007/s00493-011-2960-3. S2CID 189904526. Retrieved 2015-11-02.
Sebő, András (2013-03-18). "Eight-Fifth Approximation for the Path TSP". Eight-Fifth Approximation for the Path TSP - Springer. Lecture Notes in Computer Science. Vol. 7801. Link.springer.com. pp. 362–374. arXiv:1209.3523. doi:10.1007/978-3-642-36694-9_31. ISBN 978-3-642-36693-2. S2CID 118031668.

elte.hu

cs.elte.hu

"EGRES - Egerváry Research Group on Combinatorial Optimization". Cs.elte.hu. Retrieved 2015-11-02.

enpc.fr

cermics.enpc.fr

"Meeting in honor of Andras Sebo, April 24-25, 2014, Grenoble". Cermics.enpc.fr. 2014-03-20. Retrieved 2015-11-02.

grenoble-inp.fr

g-scop.grenoble-inp.fr

"G-SCOP - Optimisation Combinatoire (OC)". G-scop.grenoble-inp.fr. Retrieved 2015-11-02.
"G-SCOP - Laboratoire des Sciences pour la Conception, l'Optimisation et la Production de Grenoble - UMR5272". G-scop.grenoble-inp.fr. Retrieved 2015-11-02.

scinexx.de

Harald Frater (2014). "scinexx | Rekord bei mathematischer Rundreise: Neuer Algorithmus verbessert Annäherung an das Handlungsreisenden-Problem". Combinatorica. 34 (5): 597–629. doi:10.1007/s00493-011-2960-3. S2CID 189904526. Retrieved 2015-11-02.

semanticscholar.org

api.semanticscholar.org

Sebő, András; Vygen, Jens (2014-07-03). "Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs". Combinatorica. 34 (5): 597–629. arXiv:1201.1870. doi:10.1007/s00493-011-2960-3. S2CID 189904526.
Harald Frater (2014). "scinexx | Rekord bei mathematischer Rundreise: Neuer Algorithmus verbessert Annäherung an das Handlungsreisenden-Problem". Combinatorica. 34 (5): 597–629. doi:10.1007/s00493-011-2960-3. S2CID 189904526. Retrieved 2015-11-02.
Sebő, András (2013-03-18). "Eight-Fifth Approximation for the Path TSP". Eight-Fifth Approximation for the Path TSP - Springer. Lecture Notes in Computer Science. Vol. 7801. Link.springer.com. pp. 362–374. arXiv:1209.3523. doi:10.1007/978-3-642-36694-9_31. ISBN 978-3-642-36693-2. S2CID 118031668.

stanford.edu

web.stanford.edu

Shayan Oveis Gharan; Amin Saberi; Mohit Singh (2011). "A Randomized Rounding Approach to the Traveling Salesman Problem" (PDF). Proc. IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). pp. 550–559.

wired.com

"Computer Scientists Find New Shortcuts for Infamous Traveling Salesman Problem". Wired. 2013-01-30. Retrieved 2015-11-02.