Teofilo F. Gonzalez

Teofilo (Teo) Gonzalez
Born Monterrey, Mexico
Education

B.S. ITESM (1972)

Ph.D. University of Minnesota (1975)
Occupation Professor of Computer Science UCSB
Employer UC Santa Barbara
Website

Teofilo Francisco Gonzalez Arce (born January 26, 1948 in Monterrey, Mexico) is a Mexican-American computer scientist who is currently a professor of computer science at the University of California, Santa Barbara.[1]

In 1972 Gonzalez was one of the first students who earned a bachelor's degree in computer science (Ingeniero en Sistemas Computacionales) in Mexico, at the Monterrey Institute of Technology and Higher Education.[1] He completed his Ph.D. in 1975 from the University of Minnesota under the supervision of Sartaj Sahni.[1][2] He taught at the University of Oklahoma from 1975 to 1976, at the Pennsylvania State University from 1976 to 1979, at the Monterrey Institute of Technology and Higher Education from 1979 to 1980, and at the University of Texas at Dallas from 1980 to 1984, before joining the UCSB computer science faculty in 1984.[1] He spent Sabbatical Leaves at Utrecht University (1990) in the Netherlands and the Monterrey Institute of Technology and Higher Education. Professor Gonzalez became Fellow of IASTED in 2009.

He is known for his highly cited pioneering research in the hardness of approximation;[3][pub 1] for his sub-linear and best possible approximation algorithm (unless P=NP) based on the farthest-first traversal for the metric k-center problem[3][pub 2] (k-tMM clustering); and for introducing the open-shop scheduling problem as well as algorithms for its solution that have found numerous applications in several research areas as well as for his research on flow shop scheduling, and job shop scheduling algorithms.[4][pub 3][pub 4] He is the Editor of the Handbook on Approximation Algorithms and Metaheuristics,[5] Chapman & Hall / CRC 2007, and he is Co-Editor of Volume 1 (Computer Science and Software Engineering) of The Computing Handbook Set[6]

Selected publications

  1. ↑ Sahni, Sartaj; Gonzalez, Teofilo (1976), "P-complete approximation problems", Journal of the ACM, 23 (3): 555–565, doi:10.1145/321958.321975, MR 0408313.
  2. ↑ Gonzalez, T. F. (1985), "Clustering to minimize the maximum intercluster distance", Theoretical Computer Science, 38 (2-3): 293–306, doi:10.1016/0304-3975(85)90224-5, MR 807927.
  3. ↑ Gonzalez, Teofilo; Sahni, Sartaj (1976), "Open shop scheduling to minimize finish time", Journal of the ACM, 23 (4): 665–679, doi:10.1145/321978.321985, MR 0429089.
  4. ↑ Gonzalez, Teofilo; Sahni, Sartaj (1978), "Flowshop and jobshop schedules: complexity and approximation", Operations Research, 26 (1): 36–52, doi:10.1287/opre.26.1.36, MR 0465149.

References

  1. 1 2 3 4 Curriculum vitae, retrieved 2015-07-13.
  2. ↑ Teofilo F. Gonzalez at the Mathematics Genealogy Project
  3. 1 2 Williamson, David P.; Shmoys, David B. (2011), The Design of Approximation Algorithms, Cambridge University Press, p. 55, ISBN 9781139498173.
  4. ↑ Lopez, Pierre; Roubellat, François (2013), "10.3 Complexity of open shop problems", Production Scheduling, John Wiley & Sons, ISBN 9781118624029.
  5. ↑ Handbook of Approximation Algorithms and Metaheuristics (1 ed.). Cambridge, Mass.: Chapman and Hall/CRC. 2007-05-15. ISBN 9780262633246.
  6. ↑ "Computing Handbook, Third Edition: Two-Volume Set". CRC Press. Retrieved 2015-09-25.
This article is issued from Wikipedia - version of the 12/22/2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.