Email: armon
at post.tau.ac.il
I am a computer-science Ph.D. student at the
Theoretical computer-science: Exact and approximate algorithms for classic graph problems and their new variants ; On-line algorithms ; Algorithmic game-theory.
· A. Armon, Y. Azar, L. Epstein, and O. Regev. “Temporary tasks assignment resolved”. Algorithmica, 36(3): 295-314, 2003. (A preliminary version appeared in the proceedings of SODA 2002)
· A. Armon, Y. Azar, L. Epstein, and O. Regev. "On-line restricted assignment of temporary tasks with unknown duration". Information Processing Letters, 85(2): 67-72, 2003.
· A. Armon and U. Zwick. “Multicriteria global minimum cuts”. Algorithmica, 46(1): 15-26, 2006. (A preliminary version appeared in the proceedings of ISAAC 2004).
·
A. Armon, A. Avidor
and O. Schwartz. "Cooperative
TSP”. Proceedings of the 14th Annual European Symposium on
Algorithms, 41-50, 2006.
·
A. Armon. On Min-Max
r-Gatherings. Proceedings of the 5th Workshop on
Approximation and On-line Algorithms, 128-141, 2007. To appear.