Avrim Blum's research projects

• Theory of learning and clustering with similarity functions
• Algorithms for learning from labeled and unlabeled data (aka semi-supervised learning).
  • Co-training, graph-based algorithms, and trying to analyze this issue in general.
• Online learning algorithms, other Computational Learning Theory.
• Approximation algorithms for TSP-related problems.
  • TSP with Deadlines, Orienteering, Discounted-TSP, and the k-MST problem.
• Other approximation algorithms.
• Online algorithms (routing, admission control, scheduling, online auctions).
• Preference elicitation in combinatorial auctions, mechanism design, and game-theory.

For reasonably up-to-date information see:

• a web page for my 2001-2004 NSF progress reports, and
• some of my survey talks.