Jeremy Karp

Jeremy's photo

I'm Jeremy, currently a PhD candidate in Carnegie Mellon's Algorithms, Combinatorics, and Optimization program. I graduated from Brandeis University in 2010 with a B.A. in Economics and Psychology. You can view my work history here.

Some of my interests are:

I'm currently working with Prof. R. Ravi on approximation algorithms for graphic TSP in bipartite graphs. Here's a link to a recent paper (as of September 3, 2013) proving a sub-4/3 approximation for k-regular bipartite graphs.

Another research project looks into algorithms for fair divisions on (mostly) indivisible goods. I work on this project with Alex Kazachkov and Prof. Ariel Procaccia.

In the fall of 2012, I wrote a paper on pricing and queueing with Prof. Mor Harchol-Balter, Sherwin Doroudi, Christian Borgs, Jennifer Chayes, and Prof. Mustafa Akan. You can view a draft of this paper here.

Here are the courses I've taken at CMU:

You can email me at jkarp AT andrew.cmu.edu