{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:53Z","timestamp":1725664973309},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631385"},{"type":"electronic","value":"9783540691570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63138-0_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:07:24Z","timestamp":1330297644000},"page":"147-158","source":"Crossref","is-referenced-by-count":1,"title":["A parallel approximation algorithm for resource constrained scheduling and bin packing"],"prefix":"10.1007","author":[{"given":"Anand","family":"Srivastav","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Stangier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1987","unstructured":"N. Alon, L. Babai, A. Itai; A fast and simple randomized algorithm for the maximal independent set problem. J. Algo., 7 (1987), 567\u2013583.","journal-title":"J. Algo."},{"key":"14_CR2","unstructured":"N. Alon, J. Spencer, P. Erd\u00f3s; The probabilistic method. John Wiley & Sons, Inc. 1992."},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"D. Angluin, L.G. Valiant: Fast probabilistic algorithms for Hamiltonion circuits and matchings. J. Comp. Sys. Sci., Vol. 18, (1979), 155\u2013193.","journal-title":"J. Comp. Sys. Sci."},{"issue":"4","key":"14_CR4","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1145\/115234.115347","volume":"38","author":"B. Berger","year":"1991","unstructured":"B. Berger, J. Rompel; Simulating (log cn)-wise independence in NC. JACM, 38 (4), (1991), 1026\u20131046.","journal-title":"JACM"},{"key":"14_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-00074-8","volume-title":"Scheduling in computer and maufacturing systems","author":"J. Blazewicz","year":"1993","unstructured":"J. Blazewicz, K. Ecker, G. Schmidt, J. Weglarz; Scheduling in computer and maufacturing systems. Springer-Verlag, Berlin (1993)."},{"key":"14_CR6","volume-title":"Random Graphs","author":"B. Bollob\u00e0s","year":"1985","unstructured":"B. Bollob\u00e0s; Random Graphs. Academic Press, Orlando (1985)."},{"key":"14_CR7","first-page":"257","volume":"21","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, R. L. Graham, D. S. Johnson, A.C.-C. Yao; Resource constrained scheduling as generalized bin packing. JCT Ser. A, 21 (1976), 257\u2013298.","journal-title":"JCT Ser. A"},{"key":"14_CR8","volume-title":"Computers and Intractability","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey, D. S. Johnson; Computers and Intractability. W. H. Freeman and Company, New York (1979)."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, A. Schrijver; Geometrie algorithms and combinatorial optimization. Springer-Verlag (1988).","DOI":"10.1007\/978-3-642-97881-4"},{"issue":"4","key":"14_CR10","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"I. Holyer; The N P-completeness of edge coloring. SIAM J. Comp., 10 (4), (1981), 718\u2013720.","journal-title":"SIAM J. Comp."},{"key":"14_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07998-0","volume-title":"Introduction to Coding Theory","author":"J. H. Lint van","year":"1982","unstructured":"J. H. van Lint; Introduction to Coding Theory. Springer Verlag New York, Heidelberg, Berlin (1982)."},{"key":"14_CR12","volume-title":"The theory of error correcting codes","author":"F.J. MacWilliams","year":"1977","unstructured":"F.J. MacWilliams, N.J.A. Sloane; The theory of error correcting codes. North Holland, Amsterdam, (1977)."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"R. Motwani, J. Naor, M. Naor; The probabilistic method yields deterministic parallel algorithms. Proceedings 30the IEEE Conference on Foundation of Computer Science (FOCS'89), (1989), 8\u201313.","DOI":"10.1109\/SFCS.1989.63448"},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"P. Raghavan; Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comp. Sys. Sci., 37, (1988), 130\u2013143.","journal-title":"J. Comp. Sys. Sci."},{"issue":"4","key":"14_CR15","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"P. Raghavan, C. D. Thompson; Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7 (4), (1987), 365\u2013374.","journal-title":"Combinatorica"},{"key":"14_CR16","first-page":"303","volume":"45","author":"H. R\u00f6ck","year":"1983","unstructured":"H. R\u00f6ck, G. Schmidt; Machine aggregation heuristics in shop scheduling. Math. Oper. Res. 45 (1983) 303\u2013314.","journal-title":"Math. Oper. Res."},{"issue":"No.1","key":"14_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/(SICI)1098-2418(199601)8:1<27::AID-RSA2>3.0.CO;2-T","volume":"8","author":"A. Srivastav","year":"1996","unstructured":"A. Srivastav, P. Stangier; Algorithmic Chernoff-Hoeffding inequalties in integer programming. Random Structures & Algorithms, Vol. 8, No. 1, (1996), 27\u201358.","journal-title":"Random Structures & Algorithms"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"A. Srivastav, P. Stangier; Tight aproximation for resource constrained scheduling and bin packing. To appear in Discrete Applied Math. 1997.","DOI":"10.1007\/3-540-63138-0_14"},{"key":"14_CR19","unstructured":"A. Srivastav; Derandomized algorithms in combinatorial optimization. Habilitation thesis, Insitut f\u00fcr Informatik, Freie Universit\u00e4t Berlin, (1995), 180 pages."},{"key":"14_CR20","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. F. Vega de la","year":"1981","unstructured":"W. F. de la Vega, C. S. Lueker; Bin packing can be solved within 1+\u2208 in linear time. Combinatorica, 1 (1981), 349\u2013355.","journal-title":"Combinatorica"},{"key":"14_CR21","first-page":"25","volume":"3","author":"V. G. Vizing","year":"1964","unstructured":"V. G. Vizing; On an estimate of the chromatic class of a p-graph. (Russian), Diskret. Analiz. 3 (1964), 25\u201330.","journal-title":"Diskret. Analiz."}],"container-title":["Lecture Notes in Computer Science","Solving Irregularly Structured Problems in Parallel"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63138-0_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:49Z","timestamp":1605647749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63138-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631385","9783540691570"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-63138-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}