David R. Karger

Papers

Total Citations

437

H-Index

About

David R. Karger is a prominent computer scientist whose research spans algorithmic theory, crowdsourcing systems, and combinatorial optimization. He is perhaps best recognized for his foundational contributions to approximation algorithms, particularly his landmark work on the Orienteering problem and the Discounted-Reward Traveling Salesman Problem (TSP). His 2007 paper — building on earlier 2004 work — introduced the first constant-factor approximation algorithm for the rooted Orienteering problem, a breakthrough that addressed a long-standing challenge in combinatorial optimization with direct applications to robot navigation and route planning. Together, these two closely related publications have amassed over 370 citations, underscoring their lasting influence on the algorithms community. Beyond theoretical work, Karger has made significant strides in human-computer interaction and crowdsourcing. His 2012 paper on optimizing real-time crowdsourcing systems demonstrated rigorous analytic methods for managing fast-reacting worker pools, enabling crowd-powered applications that respond at interactive speeds — from cameras to instant opinion polls. This work, with 65 citations, reflects Karger's rare ability to bridge deep theoretical foundations with practical, real-world systems. His interdisciplinary contributions make him a compelling figure for students interested in algorithms, optimization, and the future of human-AI collaboration.