{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:20:01Z","timestamp":1648948801567},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":8174,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0890-5401(91)90076-e","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"103-127","source":"Crossref","is-referenced-by-count":0,"title":["The complexity of controlled selection"],"prefix":"10.1016","volume":"91","author":[{"given":"Kirk","family":"Pruhs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Manber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90076-E_BIB1","series-title":"Proceedings, 30th IEEE Symposium on Foundations of Computer Science","article-title":"Generating random spanning trees","author":"Broder","year":"1989"},{"key":"10.1016\/0890-5401(91)90076-E_BIB2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01449883","article-title":"Uber den Variabilit\u00e4tsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen","volume":"64","author":"Caratheodory","year":"1907","journal-title":"Math. Ann."},{"key":"10.1016\/0890-5401(91)90076-E_BIB3","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1080\/01621459.1985.10478201","article-title":"Application of transportation theory to statistical problems","volume":"80","author":"Causey","year":"1985","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/0890-5401(91)90076-E_BIB4","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0196-6774(89)90016-3","article-title":"Ranking and unranking spanning trees","volume":"10","author":"Colbourn","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0890-5401(91)90076-E_BIB5","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1080\/01621459.1987.10478456","article-title":"A constructive procedure for unbiased controlled rounding","volume":"82","author":"Cox","year":"1988","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/0890-5401(91)90076-E_BIB6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230150206","article-title":"Minimum cuts, modular functions, and matroid polyhedra","volume":"15","author":"Cunningham","year":"1985","journal-title":"Networks"},{"key":"10.1016\/0890-5401(91)90076-E_BIB7","series-title":"Proceedings, 20th ACM Symposium on Theory of Computation","first-page":"407","article-title":"Forests, frames, and games: Algorithms for matroid sums and applications","author":"Gabow","year":"1988"},{"key":"10.1016\/0890-5401(91)90076-E_BIB8","author":"Garey","year":"1979"},{"key":"10.1016\/0890-5401(91)90076-E_BIB9","first-page":"350","article-title":"Controlld selection\u2014A technique in probability sampling","volume":"45","author":"Goodman","year":"1950","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/0890-5401(91)90076-E_BIB10","series-title":"Proceedings, 27th IEEE Symposium on Foundations of Computer Science","first-page":"495","article-title":"Complexity measures for public-key cryptosystems","author":"Grollman","year":"1984"},{"key":"10.1016\/0890-5401(91)90076-E_BIB11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Grotschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0890-5401(91)90076-E_BIB12","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge coloring","volume":"10","author":"Hoyler","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90076-E_BIB13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","article-title":"Random generation of combinatorial structures from a uniform distribution","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90076-E_BIB14","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0890-5401(91)90076-E_BIB15","first-page":"191","article-title":"A polynomial time algorithm in linear programming","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0890-5401(91)90076-E_BIB16","author":"Konijn","year":"1973"},{"key":"10.1016\/0890-5401(91)90076-E_BIB17","author":"Lawler","year":"1976"},{"key":"10.1016\/0890-5401(91)90076-E_BIB18","volume":"Vol. 50","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0890-5401(91)90076-E_BIB19","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","article-title":"The complexity of facets (and some facets of complexity","volume":"28","author":"Papadimitriou","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90076-E_BIB20","first-page":"394","article-title":"Selected applications of minimum cuts in networks","volume":"20","author":"Picard","year":"1982","journal-title":"Infor"},{"key":"10.1016\/0890-5401(91)90076-E_BIB21","series-title":"Proceedings, Survey Methods Section of the American Statistical Association","article-title":"The computational complexity of some rounding and survey overlap problems","author":"Pruhs","year":"1989"},{"key":"10.1016\/0890-5401(91)90076-E_BIB22","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0035791","article-title":"The complexity of Controlled Selection","author":"Pruhs","year":"1989"},{"key":"10.1016\/0890-5401(91)90076-E_BIB23","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","article-title":"Probabilistic construction of deterministic algorithms: Approximating packing integer programs","volume":"37","author":"Raghavan","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90076-E_BIB24","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","article-title":"Randomized rounding: A technique for provably good algorithms and algorithmic proofs","volume":"4","author":"Raghavan","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0890-5401(91)90076-E_BIB25","author":"Tanenbaum","year":"1981"},{"key":"10.1016\/0890-5401(91)90076-E_BIB26","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing a graph into connected components","volume":"36","author":"Tutte","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0890-5401(91)90076-E_BIB27","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190076E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190076E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:46Z","timestamp":1548897946000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190076E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["089054019190076E"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90076-e","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}