{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T18:26:46Z","timestamp":1768069606848,"version":"3.49.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,10,1]],"date-time":"1988-10-01T00:00:00Z","timestamp":591667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9055,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1988,10]]},"DOI":"10.1016\/0022-0000(88)90003-7","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"130-143","source":"Crossref","is-referenced-by-count":333,"title":["Probabilistic construction of deterministic algorithms: Approximating packing integer programs"],"prefix":"10.1016","volume":"37","author":[{"given":"Prabhakar","family":"Raghavan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(88)90003-7_BIB1","series-title":"Proceedings, 17th ACM Symposium on Theory of Computing","first-page":"476","article-title":"Dual integer linear programs and the relationship between their optima","author":"aharoni","year":"1985"},{"key":"10.1016\/0022-0000(88)90003-7_BIB2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","volume":"19","author":"Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(88)90003-7_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(81)90022-6","article-title":"\u201cInteger-making\u201d theorems","volume":"3","author":"Beck","year":"1981","journal-title":"Discrete Appi. Math."},{"key":"10.1016\/0022-0000(88)90003-7_BIB4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0022-0000(88)90003-7_BIB5","series-title":"The Probabilistic Method in Combinatorics","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/0022-0000(88)90003-7_BIB6","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(88)90003-7_BIB7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BFb0121044","article-title":"A decomposition algorithm for circuit routing","volume":"24","author":"Hu","year":"1985","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0022-0000(88)90003-7_BIB8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0022-0000(88)90003-7_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(88)90003-7_BIB10","series-title":"Proceedings, 24th Annual Symposium on Foundations of Computer Science","first-page":"453","article-title":"Global wire routing in two-dimensional arrays","author":"Karp","year":"1983"},{"key":"10.1016\/0022-0000(88)90003-7_BIB11","article-title":"Wire-Routing is NP-Complete","author":"Kramer","year":"1982"},{"key":"10.1016\/0022-0000(88)90003-7_BIB12","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of optimal and fractional covers","volume":"13","author":"Lov\u00e1sz","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0022-0000(88)90003-7_BIB13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0097-3165(78)90028-6","article-title":"Balancing families of sets","volume":"25","author":"Olson","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0022-0000(88)90003-7_BIB14","series-title":"Combinatorial Optimization: Algorithmsand Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0022-0000(88)90003-7_BIB15","series-title":"Proceedings, 17th ACM Symposium on Theory of Computing","first-page":"79","article-title":"Provably good routing in graphs: Regular arrays","author":"Raghavan","year":"1985"},{"key":"10.1016\/0022-0000(88)90003-7_BIB16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","article-title":"Randomized rounding: Provably good algorithms and algorithmic proofs","volume":"7","author":"Raghavan","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0022-0000(88)90003-7_BIB17","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1090\/S0002-9947-1985-0784009-0","article-title":"Six standard deviations","volume":"289","author":"Spencer","year":"1985","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000088900037?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000088900037?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:54:18Z","timestamp":1550325258000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000088900037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,10]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,10]]}},"alternative-id":["0022000088900037"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(88)90003-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1988,10]]}}}