{"id":"https://openalex.org/W2915063610","doi":"https://doi.org/10.7287/peerj.preprints.27434v1","title":"A local search algorithm for the constrained max cut problem on hypergraphs.","display_name":"A local search algorithm for the constrained max cut problem on hypergraphs.","publication_year":2018,"publication_date":"2018-12-18","ids":{"openalex":"https://openalex.org/W2915063610","doi":"https://doi.org/10.7287/peerj.preprints.27434v1","mag":"2915063610"},"language":"en","primary_location":{"id":"doi:10.7287/peerj.preprints.27434v1","is_oa":true,"landing_page_url":"https://doi.org/10.7287/peerj.preprints.27434v1","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.7287/peerj.preprints.27434v1","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050210322","display_name":"Nasim Samei","orcid":null},"institutions":[{"id":"https://openalex.org/I125749732","display_name":"Western University","ror":"https://ror.org/02grkyz14","country_code":"CA","type":"education","lineage":["https://openalex.org/I125749732"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Nasim Samei","raw_affiliation_strings":["Computer Science, University of Western Ontario, London, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Computer Science, University of Western Ontario, London, ON, Canada","institution_ids":["https://openalex.org/I125749732"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017900722","display_name":"Roberto Solis-Oba","orcid":"https://orcid.org/0000-0002-7518-4161"},"institutions":[{"id":"https://openalex.org/I125749732","display_name":"Western University","ror":"https://ror.org/02grkyz14","country_code":"CA","type":"education","lineage":["https://openalex.org/I125749732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Roberto Solis-Oba","raw_affiliation_strings":["Computer Science, University of Western Ontario, London, On, Canada"],"affiliations":[{"raw_affiliation_string":"Computer Science, University of Western Ontario, London, On, Canada","institution_ids":["https://openalex.org/I125749732"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050210322"],"corresponding_institution_ids":["https://openalex.org/I125749732"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24628187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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.9866999983787537,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9714999794960022,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.796214759349823},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7848076820373535},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.739057183265686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7031865119934082},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6991488933563232},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6829730272293091},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.608464777469635},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5669010281562805},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.49400025606155396},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.47939515113830566},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41571491956710815},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41511115431785583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34939444065093994},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23743483424186707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12627780437469482}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.796214759349823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7848076820373535},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.739057183265686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7031865119934082},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6991488933563232},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6829730272293091},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.608464777469635},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5669010281562805},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.49400025606155396},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.47939515113830566},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41571491956710815},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41511115431785583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34939444065093994},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23743483424186707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12627780437469482},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7287/peerj.preprints.27434v1","is_oa":true,"landing_page_url":"https://doi.org/10.7287/peerj.preprints.27434v1","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"}],"best_oa_location":{"id":"doi:10.7287/peerj.preprints.27434v1","is_oa":true,"landing_page_url":"https://doi.org/10.7287/peerj.preprints.27434v1","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2037387767","https://openalex.org/W2745252358","https://openalex.org/W3165634411","https://openalex.org/W4297063357","https://openalex.org/W3000809962","https://openalex.org/W2501971168","https://openalex.org/W2113647243","https://openalex.org/W1512148653","https://openalex.org/W2778127909","https://openalex.org/W173813963"],"abstract_inverted_index":{"In":[0,74,179],"the":[1,32,46,49,52,65,69,84,110,113,119,125,142,154,173,176,188],"constrained":[2,85],"max":[3,86,114,120,126,143,156,165,170,190],"k":[4,20,38,87,116,127,144,157,191],"-cut":[5,88,117,128,145,158,192],"problem":[6,89,123,146,193],"on":[7,90,141,153],"hypergraphs,":[8],"we":[9,77,181],"are":[10],"given":[11,148],"a":[12,22,43,79,101,183],"weighted":[13],"hypergraph":[14],"H=(V,":[15],"E)":[16],",":[17,106,167],"an":[18],"integer":[19],"and":[21,64,92,124,152,160],"set":[23,33],"c":[24,72,105],"of":[25,35,48,51,103,150,175],"constraints.":[26],"The":[27],"goal":[28],"is":[29,62,172],"to":[30],"divide":[31],"V":[34],"vertices":[36],"into":[37],"disjoint":[39],"partitions":[40,61,66],"in":[41,59,71],"such":[42,107],"way":[44],"that":[45,94,133,194],"sum":[47],"weights":[50],"hyperedges":[53],"having":[54],"at":[55],"least":[56],"two":[57],"endpoints":[58],"different":[60],"maximized":[63],"satisfy":[67],"all":[68],"constraints":[70,104,111],".":[73],"this":[75],"paper":[76],"present":[78,182],"local":[80,135,184],"search":[81,136,185],"algorithm":[82,137,186],"for":[83,100,109,187],"hypergraphs":[91],"show":[93,132],"it":[95],"has":[96,161,195],"approximation":[97,162,196],"ratio":[98,163,197],"1-1/k":[99],"variety":[102],"as":[108],"defining":[112],"Steiner":[115],"problem,":[118,159],"multiway":[121],"cut":[122],"problem.":[129],"We":[130],"also":[131],"our":[134],"can":[138],"be":[139],"used":[140],"with":[147],"sizes":[149],"parts":[151],"capacitated":[155],"1-|V":[164],"|/|V|":[166],"where":[168],"|V":[169],"|":[171],"cardinality":[174],"biggest":[177],"partition.":[178],"addition,":[180],"directed":[189],"(k-1)/(3k-2).":[198]},"counts_by_year":[],"updated_date":"2025-11-25T14:43:58.451035","created_date":"2025-10-10T00:00:00"}