{"id":"https://openalex.org/W1522385977","doi":"https://doi.org/10.1007/11496199_45","title":"Inverse Problems of Some NP-Complete Problems","display_name":"Inverse Problems of Some NP-Complete Problems","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1522385977","doi":"https://doi.org/10.1007/11496199_45","mag":"1522385977"},"language":"en","primary_location":{"id":"doi:10.1007/11496199_45","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11496199_45","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5100935908","display_name":"Siming Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"government","lineage":["https://openalex.org/I19820366"]},{"id":"https://openalex.org/I4210135514","display_name":"Research Institute of Forestry Policy and Information","ror":"https://ror.org/044snpb24","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210128615","https://openalex.org/I4210134523","https://openalex.org/I4210135514"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Siming Huang","raw_affiliation_strings":["Institute of Policy and Management, Chinese Academy of Sciences, Beijing, 100080, P.R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Policy and Management, Chinese Academy of Sciences, Beijing, 100080, P.R. China","institution_ids":["https://openalex.org/I19820366","https://openalex.org/I4210135514"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100935908"],"corresponding_institution_ids":["https://openalex.org/I19820366","https://openalex.org/I4210135514"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.1962,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.42438673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"422","last_page":"426"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9487850666046143},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7466395497322083},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.688452422618866},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.667701244354248},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.6120712161064148},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5775830745697021},{"id":"https://openalex.org/keywords/p-versus-np-problem","display_name":"P versus NP problem","score":0.5613726377487183},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5205544233322144},{"id":"https://openalex.org/keywords/inverse-problem","display_name":"Inverse problem","score":0.5152440667152405},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49733689427375793},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.48251602053642273},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.4648515284061432},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45372888445854187},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44249606132507324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4267515242099762},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4141901433467865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28465116024017334},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.23184886574745178}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9487850666046143},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7466395497322083},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.688452422618866},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.667701244354248},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6120712161064148},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5775830745697021},{"id":"https://openalex.org/C186861659","wikidata":"https://www.wikidata.org/wiki/Q746242","display_name":"P versus NP problem","level":3,"score":0.5613726377487183},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5205544233322144},{"id":"https://openalex.org/C135252773","wikidata":"https://www.wikidata.org/wiki/Q1567213","display_name":"Inverse problem","level":2,"score":0.5152440667152405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49733689427375793},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.48251602053642273},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.4648515284061432},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45372888445854187},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44249606132507324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4267515242099762},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4141901433467865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28465116024017334},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.23184886574745178},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11496199_45","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11496199_45","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1594902172","https://openalex.org/W1963547452","https://openalex.org/W1966229055","https://openalex.org/W1968988195","https://openalex.org/W1971863547","https://openalex.org/W1979134936","https://openalex.org/W2001452717","https://openalex.org/W2137212783","https://openalex.org/W2143676338","https://openalex.org/W2171588996","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2412614002","https://openalex.org/W4249611560","https://openalex.org/W2993365626","https://openalex.org/W2087209118","https://openalex.org/W2381035939","https://openalex.org/W2005493932","https://openalex.org/W4256002267","https://openalex.org/W2089402478","https://openalex.org/W1969981152"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}