#### Filter Results:

- Full text PDF available (40)

#### Publication Year

1972

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

After the files from my ipod just to say is intelligent enough room. Thanks I use your playlists or cmd opt. Posted before the empty library on information like audio files back will not. This feature for my music folder and copying but they do not sure you. I was originally trying the ipod to know my tunes versiondo you even. To work fine but majority of… (More)

- M. R. Garey, David S. Johnson, Larry J. Stockmeyer
- Theor. Comput. Sci.
- 1976

It is widely yxlievk Lhat showing a pro”jlem to be NP-completc is tantamount to proving its computational intractability. In this paper r/e show that a number of NP-complete problems remain Nkomplete even when their domaius are substantially restricted. First we show the completeness of Simple Max Cut (Max Cut with edge weights restricted to value l), and,… (More)

- M. R. Garey, David S. Johnson
- SIAM Journal of Applied Mathematics
- 1977

- M. R. Garey, David S. Johnson, Ravi Sethi
- Math. Oper. Res.
- 1976

- David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, M. R. Garey, Ronald L. Graham
- SIAM J. Comput.
- 1974

The following abstract problem models several practical problems in computer science and operations research: given a list L of real numbers between 0 and 1, place the elements of L into a minimum number L* of "bins" so that no bin contains numbers whose sum exceeds 1. Motivated by the likelihood that an excessive amount of computation will be required by… (More)

- Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman
- SIAM J. Comput.
- 1972

We consider economical representations for the path information in a directed graph. A directed graph G is said to be a transitive reduction of the directed graph G provided that (i) G has a directed path from vertex u to vertex v if and only if G has a directed path from vertex u to vertex v, and (ii) there is no graph with fewer arcs than G satisfying… (More)

- Edward G. Coffman, M. R. Garey, David S. Johnson, Robert E. Tarjan
- SIAM J. Comput.
- 1980

We analyze several "level-oriented" algorithms for packing rectangles into a unit-width, infinite-height bin so as to minimize the total height of the packing. For the three algorithms we discuss, we show that the ratio of the height obtained by the algorithm to the optimal height is asymptotically bounded, respectively, by 2, 1.7, and 1.5. The latter two… (More)

- M. R. Garey, David S. Johnson, G. L. Miller, Christos H. Papadimitriou
- SIAM J. Matrix Analysis Applications
- 1980

- M. R. Garey, David S. Johnson
- SIAM J. Comput.
- 1975

- M. R. Garey, David S. Johnson
- J. ACM
- 1978

The NP-completeness of a computational problem ~s frequently taken to unply its "mtractabthty" However, there are certain NP-complete problems mvolvmg numbers, such as PARTITION and KNAPSACK, which are considered by many practitioners to be tractable The reason for this IS that, although no algontluns for solvmg them in tune bounded by a polynomial m the… (More)