Students (The Open University of Israel)
Graduated
-
Gilad Liberman.
Connectivity Augmentation Problems.
[pdf]
-
Israel Beniaminy.
Approximation Algorithms for Generalized Assignment Problems.
[pdf]
-
Elena Tsanko.
Approximating Minimum Power Network Design Problems.
[pdf]
-
Yuval Lando.
On Minimum Power Connectivity Problems.
[pdf]
-
Moran Feldman.
Approximating Minimum Cost Directed Steiner Forests.
[pdf]
-
Amir Sadeh.
Distributed primal-dual approximation algorithms for network design problems.
[pdf]
-
Yael Maduel.
Covering a laminar family by leaf to leaf links.
[pdf]
-
Johnny David.
Approximating survivable networks with beta-quasi-metric costs.
[pdf]
-
Elazar Leibovitch.
Approximating graph density problems.
[pdf]
Current M.SC. Students
-
Ariel Yaroshevitch
-
Rani Iszak
-
Hanna Feldman
-
Nachshon Cohen
Topics for Research Seminar 22952, 2009A
It is possible to choose only 1 or 2 papers from each topic.
The students are welcome to suggest topics of their own.
-
Divide and Conquer in Approxinmation Algorithms (taken).
[zip]
-
Densest Subgraphs.
[zip]
-
Allocation and Assignment Problems.
[zip]
-
Directed Degree Constrained Problems.
[zip]
-
Undirected Degree Constrained Problems.
[zip]
-
Minimum Cuts in Almost Linear Time.
[zip]
-
Gomory-Hu Cut Trees and Extreme Sets.
[zip]
-
Submodular Cover.
[zip]
-
The Recursive Greedy Method.
[zip]