Guy Kortsarz Professor
Office: 319 Business and Science Bldg. |
Research |
Research
Interests
Approximating algorithms for Network design, and wireless computing. Approximating of selecting subsets, packing problems and partitioning of graphs. Approximating scheduling problems. Polyhedra Theory. Approximating Facility location. Approximating cut and flow problems. Lower bounds for approximating NP-hard problems. The use of randomization in computer science and in particular the probabilistic method. Fix parameter tractability and approximability. On-line algorithms. Matroid theory. ![]() ![]() ![]() ![]() ![]()
![]() |
Teaching |
Talks About art. |
Electronic book. |