{"id":"https://openalex.org/W2074464358","doi":"https://doi.org/10.1007/s10852-006-9056-z","title":"On the Computational Complexity of the Minimum Committee Problem","display_name":"On the Computational Complexity of the Minimum Committee Problem","publication_year":2007,"publication_date":"2007-01-25","ids":{"openalex":"https://openalex.org/W2074464358","doi":"https://doi.org/10.1007/s10852-006-9056-z","mag":"2074464358"},"language":"en","primary_location":{"id":"doi:10.1007/s10852-006-9056-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10852-006-9056-z","pdf_url":null,"source":{"id":"https://openalex.org/S80764785","display_name":"Journal of Mathematical Modelling and Algorithms","issn_l":"1570-1166","issn":["1570-1166","1572-9214"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Mathematical Modelling and Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050865451","display_name":"Michael Khachay","orcid":"https://orcid.org/0000-0003-3555-0080"},"institutions":[{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035"]},{"id":"https://openalex.org/I4210105350","display_name":"N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences","ror":"https://ror.org/029fhmb28","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210105350","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Mikhail Yu. Khachay","raw_affiliation_strings":["Institute of Mathematics and Mechanics, Russian Academy of Sciences, Ekaterinburg, Russia","Russian Academy of Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Mechanics, Russian Academy of Sciences, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I4210105350"]},{"raw_affiliation_string":"Russian Academy of Sciences","institution_ids":["https://openalex.org/I1313323035"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050865451"],"corresponding_institution_ids":["https://openalex.org/I1313323035","https://openalex.org/I4210105350"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.13241184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"6","issue":"4","first_page":"547","last_page":"561"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6826714277267456},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6623730063438416},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5383573174476624},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5236886739730835},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5134290456771851},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4953879117965698},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4884554445743561},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.47475865483283997},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4582826495170593},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42848071455955505},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4119876027107239},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23809903860092163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19748300313949585}],"concepts":[{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6826714277267456},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6623730063438416},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5383573174476624},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5236886739730835},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5134290456771851},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4953879117965698},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4884554445743561},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.47475865483283997},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4582826495170593},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42848071455955505},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4119876027107239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23809903860092163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19748300313949585},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10852-006-9056-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10852-006-9056-z","pdf_url":null,"source":{"id":"https://openalex.org/S80764785","display_name":"Journal of Mathematical Modelling and Algorithms","issn_l":"1570-1166","issn":["1570-1166","1572-9214"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Mathematical Modelling and Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.335.6901","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.6901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://tom.imm.uran.ru/khachay/publications/mine/Khachay_revisedv5.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W561237418","https://openalex.org/W1480376833","https://openalex.org/W1606975009","https://openalex.org/W1985194351","https://openalex.org/W2011039300","https://openalex.org/W2036910311","https://openalex.org/W2053113791","https://openalex.org/W2059453880","https://openalex.org/W2143996311","https://openalex.org/W2148603752","https://openalex.org/W2567704849","https://openalex.org/W2795674018","https://openalex.org/W4230906437","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2147086810","https://openalex.org/W4376639562","https://openalex.org/W1594413663","https://openalex.org/W1496354680","https://openalex.org/W2102199239","https://openalex.org/W2952847377","https://openalex.org/W2099799577","https://openalex.org/W2019216770","https://openalex.org/W1517616038","https://openalex.org/W2782292024"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}