#### Filter Results:

- Full text PDF available (109)

#### Publication Year

1980

2017

- This year (1)
- Last 5 years (16)
- Last 10 years (53)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Dorit S. Hochbaum, Wolfgang Maass
- J. ACM
- 1985

A unified and powerful approach is presented for devising polynomial approximation schemes for many strongly NP-complete problems. Such schemes consist of families of approximation algorithms for each desired performance bound on the relative error ε > &Ogr;, with running time that is polynomial when ε is fixed. Though the polynomiality ofâ€¦ (More)

- Dorit S. Hochbaum, David B. Shmoys
- 26th Annual Symposium on Foundations of Computerâ€¦
- 1985

The problem of scheduling a set of <italic>n</italic> jobs on <italic>m</italic> identical machines so as to minimize the makespan time is perhaps the most well-studied problem in the theory of approximation algorithms for NP-hard optimization problems. In this paper the strongest possible type of result for this problem, a polynomial approximation scheme,â€¦ (More)

- Dorit S. Hochbaum, David B. Shmoys
- Math. Oper. Res.
- 1985

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.. INFORMS isâ€¦ (More)

- Dorit S. Hochbaum, David B. Shmoys
- SIAM J. Comput.
- 1988

We present a polynomial approximation scheme for the minimum makespan problem on uniform parallel processors. More specifically, the problem is to find a schedule for a set of independent jobs on a collection of machines of different speeds so that the last job to finish is completed as quickly as possible. We give a family of polynomial-time algorithms {A}â€¦ (More)

- Dorit S. Hochbaum
- Math. Program.
- 1982

- Dorit S. Hochbaum
- Discrete Applied Mathematics
- 1983

A cover in a graph G is a set of vertices C such that each edge of G has at least one endpoint in C. The vertex cover problem is the problem of finding a cover of the smallest weight in a graph whose vertices carry positive weights. This problem is known to be NP-complete even when the input is restricted to planar cubic graphs with unit weights [8]. Aâ€¦ (More)

- Dorit S. Hochbaum, David B. Shmoys
- J. ACM
- 1986

In this paper a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design is investigated. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition, forâ€¦ (More)

- Dorit S. Hochbaum
- SIAM J. Comput.
- 1982

- Dorit S. Hochbaum, Vikas Singh
- 2009 IEEE 12th International Conference onâ€¦
- 2009

This paper is focused on the Co-segmentation problem [1] - where the objective is to segment a similar object from a pair of images. The background in the two images may be arbitrary; therefore, simultaneous segmentation of both images must be performed with a requirement that the appearance of the two sets of foreground pixels in the respective images areâ€¦ (More)

- Dorit S. Hochbaum, Joseph Naor
- IPCO
- 1992

The authors present an O(inn log m) algorithm for solving feasibility in linear programs with up to two variables per inequality which is derived directly from the Fourier-Motzkin elimination method. (The number of variables and inequalities are denoted by n and m, respectively.) The running time of the algorithm dominates that of the best known algorithmâ€¦ (More)