András Sebő: Difference between revisions

Add links
From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
Improved referencing
Filling in 8 references using Reflinks
Line 1: Line 1:
{{linkrot|date=November 2015}}
{{ Infobox scientist
{{ Infobox scientist
| name = András Sebő
| name = András Sebő
Line 19: Line 18:
}}
}}


'''András Sebő''' (born 24 April 1954) is a Hungarian-French mathematician working in the areas of [[combinatorial optimization]] and [[discrete mathematics]]. Sebő is a [[French National Centre for Scientific Research]] (CNRS) Director of Research and the head of the Combinatorial Optimization.<ref>http://www.g-scop.grenoble-inp.fr/optimisation-combinatoire/optimisation-combinatoire-oc--445066.kjsp</ref> group in Laboratory G-SCOP,<ref>http://www.g-scop.grenoble-inp.fr/</ref> affiliated with the [[University of Grenoble]] and the CNRS.
'''András Sebő''' (born 24 April 1954) is a Hungarian-French mathematician working in the areas of [[combinatorial optimization]] and [[discrete mathematics]]. Sebő is a [[French National Centre for Scientific Research]] (CNRS) Director of Research and the head of the Combinatorial Optimization.<ref>{{cite web|url=http://www.g-scop.grenoble-inp.fr/optimisation-combinatoire/optimisation-combinatoire-oc--445066.kjsp |title=G-SCOP - Optimisation Combinatoire (OC) |publisher=G-scop.grenoble-inp.fr |date= |accessdate=2015-11-02}}</ref> group in Laboratory G-SCOP,<ref>{{cite web|url=http://www.g-scop.grenoble-inp.fr/ |title=G-SCOP - Laboratoire des Sciences pour la Conception, l'Optimisation et la Production de Grenoble - UMR5272 |publisher=G-scop.grenoble-inp.fr |date= |accessdate=2015-11-02}}</ref> affiliated with the [[University of Grenoble]] and the CNRS.


==Biography==
==Biography==
Line 25: Line 24:
From 1979 through 1988, Sebő was a Research Assistant and Research Fellow at [[The Computer and Automation Research Institute, Hungarian Academy of Sciences]] in Budapest.
From 1979 through 1988, Sebő was a Research Assistant and Research Fellow at [[The Computer and Automation Research Institute, Hungarian Academy of Sciences]] in Budapest.
He moved to the University of Grenoble in 1988, where he advanced to his current position of [[CNRS]] Director of Research.
He moved to the University of Grenoble in 1988, where he advanced to his current position of [[CNRS]] Director of Research.
He has held visiting positions at leading mathematical centers, including the Research Institute for Discrete Mathematics in Bonn, Germany (1988-89 as an [[Alexander von Humboldt Foundation]] Fellow and 1992-93 as the John von Neumann Professor), [[DIMACS]] (1989), [[University of Waterloo Faculty of Mathematics]] (multiple years), and the [[Hausdorff Center for Mathematics]] (2015). He is also one of seven honorary members of the Egerváry Research Group on Combinatorial Optimization.<ref>http://www.cs.elte.hu/egres/</ref>
He has held visiting positions at leading mathematical centers, including the Research Institute for Discrete Mathematics in Bonn, Germany (1988-89 as an [[Alexander von Humboldt Foundation]] Fellow and 1992-93 as the John von Neumann Professor), [[DIMACS]] (1989), [[University of Waterloo Faculty of Mathematics]] (multiple years), and the [[Hausdorff Center for Mathematics]] (2015). He is also one of seven honorary members of the Egerváry Research Group on Combinatorial Optimization.<ref>{{cite web|url=http://www.cs.elte.hu/egres/ |title=EGRES - Egerváry Research Group on Combinatorial Optimization |publisher=Cs.elte.hu |date= |accessdate=2015-11-02}}</ref>


==Research work==
==Research work==
Sebő has advised 12 Doctoral students.<ref>{{mathgenealogy|id=101396}}</ref> In 2012, Sebő and Jens Vygen<ref>https://de.wikipedia.org/wiki/Jens_Vygen</ref> developed a 7/5-approximation algorithm for the graph version of the [[traveling salesman problem]];<ref>http://link.springer.com/article/10.1007%2Fs00493-011-2960-3</ref><ref>http://www.scinexx.de/wissen-aktuell-18197-2014-11-04.html</ref> currently the best-known approximation, improving on the widely-cited 1.5-epislon result of Gharan, Saberi, and Singh.<ref>http://www.wired.com/2013/01/traveling-salesman-problem/</ref> In 2013, Sebő found also an 8/5-approximation algorithm for the path version of the TSP.<ref>http://link.springer.com/chapter/10.1007%2F978-3-642-36694-9_31</ref> A scientific conference in honor of Sebő was held April 24-25, 2014 in Grenoble, France.<ref>http://cermics.enpc.fr/~meuniefr/Andras60.html</ref>
Sebő has advised 12 Doctoral students.<ref>{{mathgenealogy|id=101396}}</ref> In 2012, Sebő and Jens Vygen developed a 7/5-approximation algorithm for the graph version of the [[traveling salesman problem]];<ref>{{cite web|url=http://link.springer.com/article/10.1007%2Fs00493-011-2960-3 |title=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 - Online First - Springer |publisher=Link.springer.com |date=2014-07-03 |accessdate=2015-11-02}}</ref><ref>{{cite web|author=Harald Frater |url=http://www.scinexx.de/wissen-aktuell-18197-2014-11-04.html |title=scinexx &#124; Rekord bei mathematischer Rundreise: Neuer Algorithmus verbessert Annäherung an das Handlungsreisenden-Problem |doi=10.1007/s00493-011-2960-3 |publisher=Scinexx.de |date= |accessdate=2015-11-02}}</ref> currently the best-known approximation, improving on the widely-cited 1.5-epislon result of Gharan, Saberi, and Singh.<ref>{{cite web|author= |url=http://www.wired.com/2013/01/traveling-salesman-problem/ |title=Computer Scientists Find New Shortcuts for Infamous Traveling Salesman Problem |publisher=WIRED |date=2013-01-30 |accessdate=2015-11-02}}</ref> In 2013, Sebő found also an 8/5-approximation algorithm for the path version of the TSP.<ref>{{cite web|author= |url=http://link.springer.com/chapter/10.1007%2F978-3-642-36694-9_31 |title=Eight-Fifth Approximation for the Path TSP - Springer |publisher=Link.springer.com |date=2013-03-18 |accessdate=2015-11-02}}</ref> A scientific conference in honor of Sebő was held April 24-25, 2014 in Grenoble, France.<ref>{{cite web|url=http://cermics.enpc.fr/~meuniefr/Andras60.html |title=Meeting in honor of Andras Sebo, April 24-25, 2014, Grenoble |publisher=Cermics.enpc.fr |date=2014-03-20 |accessdate=2015-11-02}}</ref>


==References==
==References==

Revision as of 14:32, 2 November 2015

András Sebő
Mathematical Institute Oberwolfach, 2011
Born (1954-04-24) 24 April 1954 (age 70)
Budapest
Nationality Hungary
 France
Alma materEötvös Loránd University
Scientific career
FieldsMathematics
InstitutionsCNRS, University of Grenoble
Doctoral advisorAndrás Frank
Doctoral studentsFrank Pfeiffer (1990)
W. Schwaerzler (!992)
Brahim Chaourar (1993)
Karina Marcus (1996)
Samia Ould-Ali (2000)
Mouna Sadli (2000)
Eric Tannier (2002)
Vincent Jost (2006)
Frederic Meunier (2006)
Guyslain Naves (2010)
Yohann Benchetrit (2015)
Andrea Munaro (2015)

András Sebő (born 24 April 1954) is a Hungarian-French mathematician working in the areas of combinatorial optimization and discrete mathematics. Sebő is a French National Centre for Scientific Research (CNRS) Director of Research and the head of the Combinatorial Optimization.[1] group in Laboratory G-SCOP,[2] affiliated with the University of Grenoble and the CNRS.

Biography

Sebő received his Ph.D. in 1984 from Eötvös Loránd University and he obtained the Candidate's Degree from the Hungarian Academy of Sciences in 1989, advised by András Frank. From 1979 through 1988, Sebő was a Research Assistant and Research Fellow at The Computer and Automation Research Institute, Hungarian Academy of Sciences in Budapest. He moved to the University of Grenoble in 1988, where he advanced to his current position of CNRS Director of Research. He has held visiting positions at leading mathematical centers, including the Research Institute for Discrete Mathematics in Bonn, Germany (1988-89 as an Alexander von Humboldt Foundation Fellow and 1992-93 as the John von Neumann Professor), DIMACS (1989), University of Waterloo Faculty of Mathematics (multiple years), and the Hausdorff Center for Mathematics (2015). He is also one of seven honorary members of the Egerváry Research Group on Combinatorial Optimization.[3]

Research work

Sebő has advised 12 Doctoral students.[4] In 2012, Sebő and Jens Vygen developed a 7/5-approximation algorithm for the graph version of the traveling salesman problem;[5][6] currently the best-known approximation, improving on the widely-cited 1.5-epislon result of Gharan, Saberi, and Singh.[7] In 2013, Sebő found also an 8/5-approximation algorithm for the path version of the TSP.[8] A scientific conference in honor of Sebő was held April 24-25, 2014 in Grenoble, France.[9]

References

  1. ^ "G-SCOP - Optimisation Combinatoire (OC)". G-scop.grenoble-inp.fr. Retrieved 2015-11-02.
  2. ^ "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.
  3. ^ "EGRES - Egerváry Research Group on Combinatorial Optimization". Cs.elte.hu. Retrieved 2015-11-02.
  4. ^ András Sebő at the Mathematics Genealogy Project
  5. ^ "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 - Online First - Springer". Link.springer.com. 2014-07-03. Retrieved 2015-11-02.
  6. ^ Harald Frater. "scinexx | Rekord bei mathematischer Rundreise: Neuer Algorithmus verbessert Annäherung an das Handlungsreisenden-Problem". Scinexx.de. doi:10.1007/s00493-011-2960-3. Retrieved 2015-11-02.
  7. ^ "Computer Scientists Find New Shortcuts for Infamous Traveling Salesman Problem". WIRED. 2013-01-30. Retrieved 2015-11-02.
  8. ^ "Eight-Fifth Approximation for the Path TSP - Springer". Link.springer.com. 2013-03-18. Retrieved 2015-11-02.
  9. ^ "Meeting in honor of Andras Sebo, April 24-25, 2014, Grenoble". Cermics.enpc.fr. 2014-03-20. Retrieved 2015-11-02.

External links

Retrieved from "https://en.wikipedia.org/w/index.php?title=András_Sebő&oldid=688696229"