{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:15:24Z","timestamp":1773656124743,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,1,26]],"date-time":"2007-01-26T00:00:00Z","timestamp":1169769600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,1,26]],"date-time":"2007-01-26T00:00:00Z","timestamp":1169769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1007\/s10852-006-9056-z","type":"journal-article","created":{"date-parts":[[2007,1,25]],"date-time":"2007-01-25T16:15:30Z","timestamp":1169741730000},"page":"547-561","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the Computational Complexity of the Minimum Committee Problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Mikhail Yu.","family":"Khachay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,1,26]]},"reference":[{"key":"9056_CR1","first-page":"67","volume":"1","author":"V1.D. Mazurov","year":"2002","unstructured":"Mazurov, Vl.D., Khachai, M.Yu., Rybin, A.I.: Committee constructions for solving problems of selection, diagnostics and prediction. Proc. Steklov Inst. Math. 1, 67\u2013101 (2002)","journal-title":"Proc. Steklov Inst. Math."},{"issue":"4","key":"9056_CR2","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"9056_CR3","volume-title":"Social Choice and Individual Values","author":"K.J. Arrow","year":"1963","unstructured":"Arrow, K.J.: Social Choice and Individual Values, 2nd edn. Wiley, New York (1963)","edition":"2"},{"key":"9056_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-57748-2","volume-title":"Basic Geometry of Voting.","author":"D.G. Saari","year":"1995","unstructured":"Saari, D.G.: Basic Geometry of Voting. Springer, Berlin Heidelberg New York (1995)"},{"key":"9056_CR5","volume-title":"The Theory of Committees and Elections","author":"D. Black","year":"1998","unstructured":"Black, D.: The Theory of Committees and Elections, 2nd edn. Kluwer, New York (1998)","edition":"2"},{"key":"9056_CR6","volume-title":"Statistical Learning Theory","author":"V.N. Vapnik","year":"1998","unstructured":"Vapnik, V.N.: Statistical Learning Theory. Wiley, New York (1998)"},{"key":"9056_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"Elements of Statistical Learning","author":"T. Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: Elements of Statistical Learning. Springer, Berlin Heidelberg New York (2001)"},{"key":"9056_CR8","unstructured":"Eremin, I.I.: Theory of Linear Optimization. BVM, Offenbach (2002)"},{"key":"9056_CR9","unstructured":"Eremin, I.I., Mazurov, Vl.D.: Nonstable Processes of Mathematical Programming. Nauka, Moscow (1979)"},{"key":"9056_CR10","doi-asserted-by":"crossref","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. In: Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pp. 960\u2013981. IEEE Computer Society, New York (1992)","DOI":"10.1145\/185675.306789"},{"key":"9056_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(78)90006-3","volume":"6","author":"D.S. Johnson","year":"1978","unstructured":"Johnson, D.S., Preparata, F.P.: The densest hemisphere problem. Theor. Comp. Sci. 6, 93\u2013107 (1978)","journal-title":"Theor. Comp. Sci."},{"key":"9056_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA (1979)"},{"issue":"3","key":"9056_CR13","first-page":"459","volume":"13","author":"M.Yu. Khachay","year":"2003","unstructured":"Khachay, M.Yu.: On approximate algorithm of a minimum committee of a linear inequalities system. Pattern Recognit. Image Anal. 13(3), 459\u2013464 (2003)","journal-title":"Pattern Recognit. Image Anal."},{"key":"9056_CR14","first-page":"255","volume-title":"Linear Inequalities and Related Systems","author":"D. Gale","year":"1956","unstructured":"Gale, D.: Neighboring vertices on a convex polyhedron. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems, pp. 255\u2013263. Princeton University Press, Princeton, NJ (1956)"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-006-9056-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10852-006-9056-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-006-9056-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-006-9056-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,15]],"date-time":"2022-05-15T05:21:26Z","timestamp":1652592086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10852-006-9056-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,26]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["9056"],"URL":"https:\/\/doi.org\/10.1007\/s10852-006-9056-z","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,26]]},"assertion":[{"value":"3 October 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}