Theses most similar to The value of information in shortest path optimization/ (Rinehart, Michael David; 2010) read it

Interactive proof system variants and approximation algorithms for optical networks

Sundaram, Ravi, 1968- (1996)

  • Advisor: Michael Sipser
  • Department of Electrical Engineering and Computer Science
Read it

Decoding error-correcting codes via linear programming

Feldman, Jon, 1975- (2003)

  • 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

Strategic algorithms

Nikolova, Evdokia Velinova (2009)

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

Simulation-based approximate solution of large-scale linear least squares problems and applications

Wang, Mengdi (2010)

  • Advisor: Dimitri P. Bertsekas
  • 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

Deterministic network coding by matrix completion

Harvey, Nicholas James Alexander (2005)

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

Computational metric embeddings

Sidiropoulos, Anastasios (2008)

  • Advisor: Piotr Indyk
  • 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

Focused active inference

Levine, Daniel S. (2014)

  • Advisor: Jonathan P. How
  • Department of Aeronautics and Astronautics
Read it