- Design and analysis
of
approximation algorithms for NP-hard problems, and proving
lower bounds on the approximability of NP-hard problems. - I mostly work on graph problems such as
clustering, network-design,
and scheduling problems.
|
Guy Kortsarz Associate Professor
Office: 319 Business and Science Bldg. |
| Research |
|
List of Publications
Talks
My CV
| Teaching |
| Personal |
| Pictures |