#### Filter Results:

- Full text PDF available (49)

#### Publication Year

1987

2019

- This year (17)
- Last 5 years (43)
- Last 10 years (67)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

problems To understand the class of polynomial-time solvable problems, we must first have a formal notion of what a "problem" is. We define an abstract problem Q to be a binary relation on a set I of… (More)

- David R. Karger, Clifford Stein
- J. ACM
- 1996

This paper present a new approach to finding minimum cuts in undirected graphs. The fundamental principle is simple: the edges in a graph's minimum cut form an extremely small fraction of the graph's… (More)

- Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright
- IEEE Transactions on Information Theory
- 2004

We show that for low-density parity-check (LDPC) codes whose Tanner graphs have sufficient expansion, the linear programming (LP) decoder of Feldman, Karger, and Wainwright can correct a constant… (More)

- Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein
- SODA
- 1997

We consider the problem of nonpreemptive scheduling to minimize average (weighted) completion time, allowing for release dates, parallel machines, and precedence constraints. Recent work has led to… (More)

- Foto N. Afrati, Evripidis Bampis, +8 authors Maxim Sviridenko
- FOCS
- 1999

We consider the problem of schedulingjobs with release dates onm machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation schemes… (More)

- Cynthia A. Phillips, Clifford Stein, Joel Wein
- Math. Program.
- 1998

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. In this paper we consider the problem of scheduling n jobs… (More)

- Nikhil Bansal, Kirk Pruhs, Clifford Stein
- SODA
- 2007

In addition to the traditional goal of efficiently managing time and space, many computers now need to efficiently manage power usage. For example, Intel's SpeedStep and AMD's PowerNOW technologies… (More)

- Stavros G. Kolliopoulos, Clifford Stein
- FOCS
- 1997

- Stavros G. Kolliopoulos, Clifford Stein
- IPCO
- 1997

The edge and vertex-disjoint path problems together with their unsplittable flow generalization are NP-hard problems with a multitude of applications in areas such as routing, scheduling and bin… (More)