Sotabase

Career

· RSA Professor of Mathematics, Massachusetts Institute of Technology2017–
· Leighton Family Professor of Applied Mathematics, Massachusetts Institute of Technology2007–2017
· Instructor of Applied Mathematics, Massachusetts Institute of Technology1990–1992
· Ph.D. in Applied Mathematics, Massachusetts Institute of Technology1990–
· M.S. in Applied Mathematics, UCLouvain1987–

Publications (0)

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
JACM · 1995
4,016
cited
A general approximation technique for constrained forest problems
ACM-SIAM Symposium on Discrete Algorithms · 1992
930
cited
Approximating the stochastic knapsack problem: the benefit of adaptivity
45th Annual IEEE Symposium on Foundations of Computer Science · 2004
389
cited
Semidefinite programming in combinatorial optimization
Mathematical programming · 1997
379
cited
.879-approximation algorithms for MAX CUT and MAX 2SAT
Symposium on the Theory of Computing · 1994
376
cited
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
Proceedings Third Israel Symposium on the Theory of Computing and Systems · 1995
368
cited
Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover
International Colloquium on Automata, Languages and Programming · 1993
314
cited
A note on the prize collecting traveling salesman problem
Mathematical programming · 1993
300
cited
Tight approximation algorithms for maximum general assignment problems
ACM-SIAM Symposium on Discrete Algorithms · 2006
297
cited
Improved approximation algorithms for network design problems
ACM-SIAM Symposium on Discrete Algorithms · 1994
259
cited
New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics · 1994
257
cited
Sink equilibria and convergence
IEEE Annual Symposium on Foundations of Computer Science · 2005
241
cited
A primal-dual approximation algorithm for generalized steiner network problems
Comb. · 1993
229
cited
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem
ACM-SIAM Symposium on Discrete Algorithms · 2010
212
cited
An improved approximation ratio for the minimum latency problem
ACM-SIAM Symposium on Discrete Algorithms · 1996
209
cited
Cooperative facility location games
ACM-SIAM Symposium on Discrete Algorithms · 2000
201
cited
Survivable networks, linear programming relaxations and the parsimonious property
Mathematical programming · 1993
201
cited
A catalog of steiner tree formulations
Networks · 1993
189
cited
Market sharing games applied to content distribution in ad hoc networks
IEEE Journal on Selected Areas in Communications · 2004
188
cited
Approximating submodular functions everywhere
ACM-SIAM Symposium on Discrete Algorithms · 2009
176
cited
Sotabase