乐胖代购免代理版

{"id":"https://openalex.org/W2157466330","doi":"https://doi.org/10.1109/icnn.1993.298783","title":"Optimization by reduction to maximum clique","display_name":"Optimization by reduction to maximum clique","publication_year":2002,"publication_date":"2002-12-30","ids":{"openalex":"https://openalex.org/W2157466330","doi":"https://doi.org/10.1109/icnn.1993.298783","mag":"2157466330"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnn.1993.298783","pdf_url":null,"source":{"id":"https://openalex.org/S4306512819","display_name":"IEEE International Conference on Neural Networks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5064216976","display_name":"Arun Jagota","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Jagota","raw_affiliation_strings":["Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA","institution_ids":["https://openalex.org/I63190737"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064216976"],"corresponding_institution_ids":["https://openalex.org/I63190737"],"apc_list":null,"apc_paid":null,"fwci":0.587,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":10,"citation_normalized_percentile":{"value":0.667402,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":79,"max":80},"biblio":{"volume":null,"issue":null,"first_page":"1526","last_page":"1531"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.998,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.998,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9943,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9882,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/clique","display_name":"Clique","score":0.756347},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.6697172},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4452134},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.44519693},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.41300243}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.756347},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6697172},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6126856},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.54184},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.53039306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49657208},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4698559},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.462451},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4452134},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.44519693},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43240672},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.41300243},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40123752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39371598},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37673062},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.35886526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35436302},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15983808},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11006537},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnn.1993.298783","pdf_url":null,"source":{"id":"https://openalex.org/S4306512819","display_name":"IEEE International Conference on Neural Networks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.88,"display_name":"Affordable and clean energy"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":29,"referenced_works":["https://openalex.org/W1509099013","https://openalex.org/W1511255594","https://openalex.org/W1514583064","https://openalex.org/W1537809898","https://openalex.org/W1600816199","https://openalex.org/W1606746496","https://openalex.org/W1964878205","https://openalex.org/W1973284970","https://openalex.org/W1976890066","https://openalex.org/W1990216426","https://openalex.org/W1990566849","https://openalex.org/W2008816554","https://openalex.org/W2011039300","https://openalex.org/W2027289638","https://openalex.org/W2031369070","https://openalex.org/W2087662271","https://openalex.org/W2095107881","https://openalex.org/W2112246162","https://openalex.org/W2118318123","https://openalex.org/W2123162259","https://openalex.org/W2128084896","https://openalex.org/W2133671888","https://openalex.org/W2143391442","https://openalex.org/W2166867668","https://openalex.org/W2301534342","https://openalex.org/W2401610261","https://openalex.org/W2913256821","https://openalex.org/W4285719527","https://openalex.org/W59014114"],"related_works":["https://openalex.org/W4285171291","https://openalex.org/W3203939381","https://openalex.org/W2951533720","https://openalex.org/W2787305781","https://openalex.org/W2165678151","https://openalex.org/W2162082186","https://openalex.org/W2140498717","https://openalex.org/W2082603400","https://openalex.org/W2005991213","https://openalex.org/W1796509207"],"abstract_inverted_index":{"MAX-CLIQUE":[0],"is":[1,53,107],"the":[2,18,70,110,117,122],"optimization":[3,22],"problem":[4],"of":[5,69,74,112,125],"finding":[6],"a":[7,11,25,47,82,103],"largest":[8],"clique":[9],"in":[10,24,72,81,102,121],"given":[12],"graph.":[13],"By":[14],"reduction":[15],"to":[16],"MAX-CLIQUE,":[17],"following":[19],"three":[20],"NP-hard":[21],"problems":[23,41,78,120],"binary":[26,84],"weights":[27,85],"Hopfield":[28],"net":[29],"special":[30],"case":[31],"are":[32,64,79,100],"solved:":[33],"minimum":[34],"vertex":[35],"and":[36,43,66],"set":[37],"cover,":[38],"constraint":[39],"satisfaction":[40],"(N-queens),":[42],"Boolean":[44],"satisfiability":[45],"(using":[46],"recent":[48],"reduction).":[49],"The":[50,60],"approximation":[51],"performance":[52],"experimentally":[54],"determined":[55],"on":[56],"uniformly-at-random":[57],"generated":[58],"instances.":[59],"author's":[61],"optimizing":[62],"dynamics":[63],"discrete":[65],"converge,":[67],"independently":[68],"problem,":[71],"O(number":[73],"units)":[75],"unit-switches.":[76],"Several":[77],"optimized":[80],"single":[83],"(0/-1)":[86],"network,":[87],"which,":[88],"for":[89,116],"all":[90],"problems,":[91],"admits":[92],"no":[93],"invalid":[94,128],"solutions.":[95],"All":[96],"reductions,":[97],"except":[98],"one,":[99],"goodness-preserving":[101],"formal":[104],"sense.":[105],"This":[106],"contrasted":[108],"with":[109],"variety":[111],"handcrafted":[113],"energy":[114],"functions":[115],"same":[118],"individual":[119],"literature,":[123],"several":[124],"which":[126],"admit":[127],"solutions.<":[129],">":[132]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2157466330","counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2024-12-13T08:27:48.594766","created_date":"2016-06-24"}