Theses most similar to Vertex sparsification and universal rounding algorithms (Moitra, Ankur; 2011) read it

Robustness in large-scale random networks

Kim, Minkyu, 1976- (2003)

  • Advisor: Médard, Muriel
  • Department of Electrical Engineering and Computer Science
Read it

Probabilistic methods in combinatorial and stochastic optimization

Vondrák, Jan, 1974- (2005)

  • Advisor: Michel Goemans
  • Department of Mathematics
Read it

The bidimensionality theory and its algorithmic applications

Hajiaghayi, MohammadTaghi (2005)

  • Advisor: Erik D. Demaine
  • Department of Mathematics
Read it

Approximation algorithms for distributed and selfish agents

Mirrokni, Vahab S (2005)

  • Advisor: Michel Goemans
  • Department of Mathematics
Read it

Admission control and routing : theory and practice

Gawlick, Rainer (1995)

  • Advisor: Nancy A. Lynch
  • Department of Electrical Engineering and Computer Science
Read it

Experimental study of minimum cut algorithms

Levine, Matthew S. (Matthew Steven) (1997)

  • Advisor: David R. Karger
  • Department of Electrical Engineering and Computer Science
Read it

Approximate inference : decomposition methods with applications to networks

Jung, Kyomin (2009)

  • Advisor: Devavrat Shah
  • Department of Mathematics
Read it

From graphs to matrices, and back : new techniques for graph algorithms

Mądry, Aleksander (2011)

  • Advisors: Jonathan A. Kelner; Michel Goemans
  • Department of Electrical Engineering and Computer Science
Read it

The complexity of optimal mechanism design

Tzamos, Christos (2013)

  • Advisor: Constantinos Daskalakis
  • Department of Electrical Engineering and Computer Science
Read it

Improved distributed algorithms for fundamental graph problems

Ghaffari, Mohsen (2017)

  • Advisor: Nancy Lynch
  • Department of Electrical Engineering and Computer Science
Read it