Add to ORKGThesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.Includes bibliographical references (p. [123]-126).by Matthew S. Levine.M.S
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.Includes bibliogr...
Based on a Thesis (M.S.)--Massachusetts Institute of Technology, Sloan School of Management, 1995.In...
We signicantly improve known time bounds for solving the minimum cut problem on undirected graphs. W...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
This thesis investigates various computational approaches to the Maximum Cut problem. It is generall...
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionar...
In the late eighties and early nineties, three major exciting new developments (and some ramificatio...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
AbstractAn approximation algorithm for the maximum cut problem is designed and analyzed; its perform...
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs....
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionar...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and...
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Expe...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.Includes bibliogr...
Based on a Thesis (M.S.)--Massachusetts Institute of Technology, Sloan School of Management, 1995.In...
We signicantly improve known time bounds for solving the minimum cut problem on undirected graphs. W...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
This thesis investigates various computational approaches to the Maximum Cut problem. It is generall...
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionar...
In the late eighties and early nineties, three major exciting new developments (and some ramificatio...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
AbstractAn approximation algorithm for the maximum cut problem is designed and analyzed; its perform...
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs....
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionar...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and...
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Expe...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.Includes bibliogr...
Based on a Thesis (M.S.)--Massachusetts Institute of Technology, Sloan School of Management, 1995.In...
We signicantly improve known time bounds for solving the minimum cut problem on undirected graphs. W...