Theses most similar to 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) read it
- Advisor: Erik Demaine
- Department of Mathematics
New geometric techniques for linear programming and graph partitioning
Kelner, Jonathan, 1980- (2006)
- Advisors: Daniel A. Spielman; Madhu Sudan
- Department of Electrical Engineering and Computer Science
- Advisor: Alexander Postnikov
- Department of Mathematics
- Advisor: Madhu Sudan
- Department of Electrical Engineering and Computer Science
- Advisor: Jacob Fox
- Department of Mathematics
Combinatorics of permutation patterns, interlacing networks, and Schur functions
Trongsiriwat, Wuttisak (2015)
- Advisor: Alexander Postnikov
- Department of Mathematics
Combinatorics of acyclic orientations of graphs : algebra, geometry and probability
Iriarte Giraldo, Benjamin (2015)
- Advisor: Richard P. Stanley
- Department of Mathematics
Sublinear-time algorithms for counting star subgraphs with applications to join selectivity estimation
Peebles, John Lee Thompson, Jr (2016)
- Advisors: Jon Kelne; Ronitt Rubinfeld
- Department of Electrical Engineering and Computer Science
Contraction maps and applications to the analysis of iterative algorithms
Zampetakis, Emmanouil (2017)
- Advisor: Constantinos Daskalakis
- Department of Electrical Engineering and Computer Science
- Advisor: Piotr Indyk
- Department of Electrical Engineering and Computer Science