乐胖代购免代理版

{"id":"https://openalex.org/W2107558785","doi":"https://doi.org/10.1109/paap.2010.23","title":"The Complement of Hypergraph Capacitated Min-k-Cut Problem","display_name":"The Complement of Hypergraph Capacitated Min-k-Cut Problem","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2107558785","doi":"https://doi.org/10.1109/paap.2010.23","mag":"2107558785"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/paap.2010.23","pdf_url":null,"source":null,"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/A5100413098","display_name":"Wenxing Zhu","orcid":"https://orcid.org/0000-0002-8698-0024"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"None Wenxing Zhu","raw_affiliation_strings":["Center for Discrete Math. & Theor. Comput. Sci., Fuzhou Univ., Fuzhou, China"],"affiliations":[{"raw_affiliation_string":"Center for Discrete Math. & Theor. Comput. Sci., Fuzhou Univ., Fuzhou, China","institution_ids":["https://openalex.org/I80947539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100668321","display_name":"Jiarui Chen","orcid":"https://orcid.org/0000-0003-2005-288X"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"None Jiarui Chen","raw_affiliation_strings":["Center for Discrete Math. & Theor. Comput. Sci., Fuzhou Univ., Fuzhou, China"],"affiliations":[{"raw_affiliation_string":"Center for Discrete Math. & Theor. Comput. Sci., Fuzhou Univ., Fuzhou, China","institution_ids":["https://openalex.org/I80947539"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.267,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":3,"citation_normalized_percentile":{"value":0.515022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":75,"max":77},"biblio":{"volume":null,"issue":null,"first_page":"395","last_page":"397"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9989,"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/T12288","display_name":"Optimization and Search Problems","score":0.9989,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9979,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.997,"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/maximum-cut","display_name":"Maximum cut","score":0.7564142},{"id":"https://openalex.org/keywords/complement","display_name":"Complement","score":0.6692021},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.63932604},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.47327802},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4244204}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.7564142},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.6692021},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.63932604},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5473901},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.483556},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.47327802},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42852017},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4244204},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.42273968},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41665852},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.41388705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38485956},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3781942},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36917406},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3688314},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/paap.2010.23","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":23,"referenced_works":["https://openalex.org/W110441439","https://openalex.org/W1971758446","https://openalex.org/W1977360022","https://openalex.org/W2004699374","https://openalex.org/W2011482914","https://openalex.org/W2022490362","https://openalex.org/W2030087828","https://openalex.org/W2042216983","https://openalex.org/W2069985946","https://openalex.org/W2084250224","https://openalex.org/W2095117703","https://openalex.org/W2112587384","https://openalex.org/W2117271622","https://openalex.org/W2122466336","https://openalex.org/W2130751117","https://openalex.org/W2139557692","https://openalex.org/W2143516773","https://openalex.org/W2161455936","https://openalex.org/W2169528477","https://openalex.org/W2244550955","https://openalex.org/W2403101477","https://openalex.org/W4230657393","https://openalex.org/W4249939137"],"related_works":["https://openalex.org/W4385849188","https://openalex.org/W2942946217","https://openalex.org/W2903538031","https://openalex.org/W2186707160","https://openalex.org/W2141353198","https://openalex.org/W2129497110","https://openalex.org/W2115772827","https://openalex.org/W2078695342","https://openalex.org/W1974018476","https://openalex.org/W1572441411"],"abstract_inverted_index":{"The":[0,22,94],"capacitated":[1,86,126],"min-k-cut":[2,87],"problem":[3,7,37,42],"of":[4,8,29,66,92,101,109],"hypergraphis":[5],"the":[6,10,27,64,90,106,116],"partitioning":[9],"vertices":[11],"into":[12],"k":[13],"parts,":[14],"and":[15,118],"each":[16],"part":[17],"has":[18],"a":[19,79,97],"different":[20],"capacity.":[21],"objective":[23],"is":[24,34,39,72,105],"to":[25,46,63],"minimize":[26],"weight":[28],"cut":[30],"hyper":[31,84,111,124],"edges.":[32,112],"It":[33],"an":[35,40,120],"NP-hard":[36],"which":[38],"important":[41],"with":[43],"extensive":[44],"applications":[45],"many":[47,57],"areas,":[48],"such":[49,75],"as":[50],"VLSI":[51],"CAD,":[52],"image":[53],"segmentation,":[54],"etc.":[55],"Although":[56],"heuristic":[58],"algorithms":[59],"have":[60],"been":[61],"developed,":[62],"best":[65],"our":[67],"knowledge,":[68],"no":[69],"approximation":[70,99],"algorithm":[71,82,95,117],"known":[73],"for":[74,83,123],"problem.":[76,128],"We":[77,113],"present":[78],"local":[80],"search":[81],"graph":[85,125],"problem,":[88],"using":[89],"idea":[91],"complement.":[93],"achieves":[96],"competitive":[98],"factor":[100],"1/(1+s/2(k-1)),":[102],"where":[103],"s":[104],"largest":[107],"cardinality":[108],"all":[110],"also":[114],"extend":[115],"get":[119],"approximate":[121],"result":[122],"max-k-cut":[127]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2107558785","counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2024-12-17T13:02:12.154926","created_date":"2016-06-24"}