{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:28:43Z","timestamp":1725456523373},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540513711"},{"type":"electronic","value":"9783540462019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035791","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:00:28Z","timestamp":1133427628000},"page":"672-686","source":"Crossref","is-referenced-by-count":1,"title":["The complexity of controlled selection"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01449883","volume":"64","author":"C. Caratheodory","year":"1907","unstructured":"C. Caratheodory, Uber den Variabilitatsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen, Math. Ann., 64, 1907, pp. 95\u2013115.","journal-title":"Math. Ann."},{"key":"44_CR2","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1080\/01621459.1985.10478201","volume":"80","author":"B. D. Causey","year":"1985","unstructured":"B. D. Causey, L.H. Cox, and L.R. Ernst, Applications of Transportation Theory to Statistical Problems, Journal of the American Statistical Association, 80, 1985, pp. 903\u2013909.","journal-title":"Journal of the American Statistical Association"},{"key":"44_CR3","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1080\/01621459.1987.10478456","volume":"82","author":"L. H. Cox","year":"1988","unstructured":"L. H. Cox, A Constructive Procedure for Unbiased Controlled Rounding, Journal of the American Statistical Association, 82, 1988, pp. 520\u2013524.","journal-title":"Journal of the American Statistical Association"},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230150206","volume":"15","author":"W.H. Cunningham","year":"1985","unstructured":"W.H. Cunningham, Minimum Cuts, Modular Functions, and Matroid Polyhedra, Networks, 15, 1985, pp. 205\u2013215.","journal-title":"Networks"},{"key":"44_CR5","volume-title":"Computers and Intractability, A Guide to NP-completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson, Computers and Intractability, A Guide to NP-completeness, W.H. Freeman and Company, New York, 1979."},{"key":"44_CR6","first-page":"350","volume":"45","author":"R. Goodman","year":"1950","unstructured":"R. Goodman, and L. Kish, Controlled Selection \u2014 A Technique in Probability Sampling, Journal of the American Statistical Association, 45, 1950, pp. 350\u2013372.","journal-title":"Journal of the American Statistical Association"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"J. Grollman and A. Selman, Complexity Measures for Public-Key Cryptosystems, 25th Annual Symposium on Foundations of Computer Science, October 1984, pp. 495\u2013503.","DOI":"10.1109\/SFCS.1984.715952"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"H. Gabow and H. Westermann, Forests, Frames, and Games: Algorithms for Matroid Sums and Applications, 20th Annual ACM Symposium on Theory of Computing, May 1988, pp. 407\u2013421.","DOI":"10.1145\/62212.62252"},{"key":"44_CR9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Grotschel","year":"1981","unstructured":"M. Grotschel, L. Lov\u00e1sz and A. Schrijver, The Ellipsoid Method and its Consequences in Combinatorial Optimization, Combinatorica, 1, 1981, pp. 169\u2013197. [Corrigendum: 4, 1984, pp. 291\u2013295].","journal-title":"Combinatorica"},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"I. Holyer, The NP-completeness of Edge Coloring, SIAM Journal of Computing, 10, 1981, pp.718\u2013720.","journal-title":"SIAM Journal of Computing"},{"key":"44_CR11","volume-title":"Probability Sampling of Hospitals and Patients","author":"I. Hess","year":"1975","unstructured":"I. Hess, T. Fitzpatrick and D. Riedel, Probability Sampling of Hospitals and Patients, 2nd edition, Health Administration Press, Ann Arbor, Michigan, 1975.","edition":"2"},{"key":"44_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"R. Karp, Reducibility Among Combinatorial Problems, in Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85\u2013104."},{"key":"44_CR13","first-page":"191","volume":"20","author":"L. Khachiyan","year":"1979","unstructured":"L. Khachiyan, A Polynomial Algorithm in Linear Programming, Soviet Math. Dok., 20, 1979, pp. 191\u2013194.","journal-title":"Soviet Math. Dok."},{"key":"44_CR14","volume-title":"Statistical Theory of Sample Survey Design and Analysis","author":"H. Konijn","year":"1973","unstructured":"H. Konijn, Statistical Theory of Sample Survey Design and Analysis, North Holland, Amsterdam, 1973."},{"key":"44_CR15","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"1976","unstructured":"E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, New York, 1976."},{"key":"44_CR16","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970203","volume-title":"An Algorithmic Theory of Numbers, Graphs and Convexity","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz, An Algorithmic Theory of Numbers, Graphs and Convexity, CBMS 50, SIAM, Philadelphia, Pennsylvania, 1986."},{"key":"44_CR17","unstructured":"J. Pollock, PPES Sampling of Two Subdomains with Independent Probabilities, Proceedings of the Survey Research Methods Section, American Statistical Association, 1984, pp. 223\u2013227."},{"key":"44_CR18","first-page":"394","volume":"20","author":"J. Picard","year":"1982","unstructured":"J. Picard and M. Queyranne, Selected Applications of Minimum Cuts in Networks, INFOR, 20, 1982, pp. 394\u2013422.","journal-title":"INFOR"},{"key":"44_CR19","unstructured":"K. Pruhs, The Complexity of Some Three Dimensional Rounding Problems, University of Wisconsin-Madison Technical Report # 715, 1987."},{"key":"44_CR20","unstructured":"K. Pruhs, The Complexity of Controlled Selection, Ph.D. thesis, University of Wisconsin, in preparation."},{"key":"44_CR21","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","volume":"28","author":"C. Papadimitriou","year":"1982","unstructured":"C. Papadimitriou and M. Yannakakis, The Complexity of Facets (and some Facets of Complexity), Journal of Computer and System Sciences, 28, 1982, pp. 244\u2013259.","journal-title":"Journal of Computer and System Sciences"},{"key":"44_CR22","doi-asserted-by":"crossref","unstructured":"P. Raghavan, Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs, 27th Annual Symposium on Foundations of Computer Science, October 1986, pp. 10\u201318.","DOI":"10.1109\/SFCS.1986.45"},{"key":"44_CR23","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"P. Raghavan, and D. Thompson, Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs, Combinatorica, 7, 1987, pp. 365\u2013374.","journal-title":"Combinatorica"},{"key":"44_CR24","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W. Tutte","year":"1961","unstructured":"W. Tutte, On the Problem of Decomposing a Graph into n Connected Components, Journal of the London Mathematical Society, 36, 1961, pp. 221\u2013230.","journal-title":"Journal of the London Mathematical Society"},{"key":"44_CR25","unstructured":"H. Tsao and T. Wright, An Empirical Study on Maximizing (or Minimizing) the Number of Retentions in Unequal Probability Sampling Without Replacement: Two Units per Stratum, Proceedings of the Survey Research Methods Section, American Statistical Association, 1984, pp. 218\u2013221."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T05:18:09Z","timestamp":1549430289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0035791","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}