• Publications
  • Influence
Introduction to Algorithms, Second Edition
tl;dr
We define an abstract problem Q to be a binary relation on a set I of problem instances and a set S of problem solutions. Expand
  • 2,909
  • 228
  • Open Access
Introduction to Algorithms, Third Edition
tl;dr
This book is a great resource on the basic tools used to analyze the performance of algorithms.If you had to buy just one text on algorithms, Introduction to Algorithms is a magnificent choice. Expand
  • 2,634
  • 154
  • Open Access
A new approach to the minimum cut problem
tl;dr
We present a randomized, strongly polynomial algorithm that finds the minimum cut in an arbitrarily weighted undirected graph with high probability. Expand
  • 410
  • 51
  • Open Access
Approximation techniques for average completion time scheduling
tl;dr
We consider the problem of nonpreemptive scheduling to minimize average (weighted) completion time, allowing for release dates, parallel machines, and precedence constraints. Expand
  • 219
  • 32
  • Open Access
Approximation schemes for minimizing average weighted completion time with release dates
tl;dr
In this paper, we present the first PTASs for scheduling to minimize average weighted completion time in the presence of release dates in various machine models. Expand
  • 195
  • 29
  • Open Access
Minimizing average completion time in the presence of release dates
tl;dr
A natural and basic problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time. Expand
  • 171
  • 26
Optimal Time-Critical Scheduling via Resource Augmentation
tl;dr
We study two fundamental problems in dynamic scheduling: scheduling to meet deadlines in a preemptive multiprocessor setting, and scheduling to provide good response time in a number of scheduling environments. Expand
  • 358
  • 20
  • Open Access
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
tl;dr
In the edge(vertex)-disjoint path problem we are given a graph $G$ and a set ${\cal T} of connection requests. Expand
  • 101
  • 17