Sneha Girap (Editor)

András Frank

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Nationality
  
Hungary

Role
  
Mathematician

Notable students
  
Eva Tardos

Name
  
Andras Frank

Doctoral advisor
  
Laszlo Lovasz

Fields
  
Mathematics

Alma mater
  
University of Szeged

Education
  
University of Szeged


Andras Frank httpsowpdbmfodephotoNormalid11188

Born
  
3 June 1949 (age 74) Budapest (
1949-06-03
)

Institutions
  
Eotvos Lorand University

Books
  
Connections in Combinatorial Optimization

Similar People
  
Laszlo Lovasz, Eva Tardos, Uriel Feige, Sanjeev Arora, Shafi Goldwasser

Doctoral students
  
Andras Sebo Eva Tardos

Andr s frank non tdi optimization with supermodular functions


András Frank (born 3 June 1949) is a Hungarian mathematician, working in combinatorics, especially in graph theory, and combinatorial optimisation. He is director of the Institute of Mathematics of the Eötvös Loránd University, Budapest.

Contents

Mathematical work

András Frank Andrs Frank

Using the LLL-algorithm, Frank, and his student, Éva Tardos developed a general method, which could transform some polynomial-time algorithms into strongly polynomial. He solved the problem of finding the minimum number of edges to be added to a given undirected graph so that in the resulting graph the edge-connectivity between any two vertices u and v is at least a predetermined number f(u,v).

Degrees, awards

András Frank wwwcseltehuopresfenykepekfrankgif

He received the Candidate of Mathematical Science degree in 1980, advisor: László Lovász, and the Doctor of Mathematical Science degree (1990) from the Hungarian Academy of Sciences. He was awarded the Tibor Szele Prize of the János Bolyai Mathematical Society in 2002 and the Albert Szent-Györgyi Prize in 2009. In June 2009 the ELTE Mathematical Institute sponsored a workshop in honor of his 60th birthday.

References

András Frank Wikipedia