 | J.K. Skwirzynski - 1981 - 730 páginas
...of the Star-Star Connection Problem", Dept. of EECS, Princeton Univ., Princeton, NJ , June 1980. 25. MR Garey and DS Johnson, "Strong NP-Completeness Results: Motivation, Examples and Implications", J. ACM, 25 (1978), U99-508. 26. G. Hadley, Linear Programming, Addisopn Wesley, Reading, MA, 1965.... | |
 | Gheorghe P?un, Grzegorz Rozenberg, Arto Salomaa - 2004 - 680 páginas
...better worst case ratio than Graham's list scheduling. SIAM Journal on Computing 22 (1993), 349-355. 25. MR Garey and DS Johnson. 'Strong' NP-completeness...Motivation, examples, and implications. Journal of the ACM 25 (1978), 499-508. 26. MR Garey and DS Johnson. Computers and Intractability: A Guide to the Theory... | |
 | Peter Brucker - 2004 - 392 páginas
...Two-processor scheduling with start-times and deadlines. SIAM Journal on Computing, 6(3):416426, 1977. [91] MR Garey and DS Johnson. "Strong" NP-completeness...motivation, examples, and implications. Journal of the Association for Computing Machinery, 25(3):499-508, 1978. [92] MR Garey and DS Johnson. Computers and... | |
 | Laurence T. Yang, Minyi Guo - 2005 - 500 páginas
...worst case ratio than Graham's list scheduling, SIAM Journal on Computing, 22(2), 349-355, 1993. 5. MR Garey and DS Johnson, Strong NP-completeness results:...Motivation, examples, and implications, Journal of the A CM, 25(3), 499-508, 1978. 6. RL Graham, Bounds for certain multiprocessing anomalies, Bell System... | |
| |
Strong' NP-completeness results: Motivation, examples, and implications. Journal of the ACM 25 (1978), 499-508. 