#### Filter Results:

- Full text PDF available (43)

#### Publication Year

1972

2015

- This year (0)
- Last 5 years (5)
- Last 10 years (7)

#### 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

- 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)

- M. R. Garey, David S. Johnson, Larry J. Stockmeyer
- STOC
- 1974

It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this paper we show that a number of NP-complete problems remain NP-complete even when their domains are substantially restricted. First we show the completeness of SIMPLE MAX CUT (MAX CUT with edge weights restricted to value 1), and,ā¦ (More)

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

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

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

- M. R. Garey, David S. Johnson, Robert E. Tarjan
- SIAM J. Comput.
- 1976

- 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)

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

Given a set 3-= {T1, T2, , T,} of tasks, each T/having execution time 1, an integer start-time si-> 0 and a deadline di> 0, along with precedence constraints among the tasks, we examine the problem of determining whether there exists a schedule on two identical processors that executes each task in the time interval between its start-time and deadline. Weā¦ (More)