C. Stein

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

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

We present a randomized, strongly polynomial algorithm that finds the minimum cut in an arbitrarily weighted undirected graph with high probability. Expand

We consider the problem of nonpreemptive scheduling to minimize average (weighted) completion time, allowing for release dates, parallel machines, and precedence constraints. Expand

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

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

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

In the edge(vertex)-disjoint path problem we are given a graph $G$ and a set ${\cal T} of connection requests. Expand