Theses most similar to The Directed Steiner Network problem is tractable for a constant number of terminals (Feldman, Jon, 1975-; 2000) 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

Traveling salesman path problems

Lam, Fumei (2005)

  • Advisor: Michel Goemans
  • Department of Mathematics
Read it

Robust network computation

Pritchard, David (David Alexander Griffith) (2005)

  • Advisor: Santosh Vempala
  • Department of Electrical Engineering and Computer Science
Read it

Convergence speed in distributed consensus and averaging

Olshevsky, Alexander (2006)

  • Advisor: John N. Tsitsiklis
  • 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

Deterministic algorithms for the Lovász Local Lemma

Haeupler, Bernhard (2010)

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

Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs

Telha Cornejo, Claudio (Claudio A.) (2012)

  • Advisor: Andreas S. Schulz
  • Operations Research Center
Read it

Matroid prophet inequalities and Bayesian mechanism design

Weinberg, S. Matthew (Seth Matthew) (2012)

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

Bounds on multithreaded computations by work stealing

Suksompong, Warut (2014)

  • Advisor: Charles E. Leiserson
  • Department of Electrical Engineering and Computer Science
Read it

Scheduling to minimize power consumption using submodular functions

Zadimoghaddam, Morteza (2010)

  • Advisor: Erik D. Demaine
  • Department of Electrical Engineering and Computer Science
Read it