{"id":"https://openalex.org/W1969189142","doi":"https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<163::aid-rsa10>3.0.co;2-p","title":"A combinatorial design approach to MAXCUT","display_name":"A combinatorial design approach to MAXCUT","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W1969189142","doi":"https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<163::aid-rsa10>3.0.co;2-p","mag":"1969189142"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1098-2418(199608/09)9:1/2<163::aid-rsa10>3.0.co;2-p","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<163::aid-rsa10>3.0.co;2-p","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures 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/A5109240751","display_name":"Thomas Hofmeister","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Thomas Hofmeister","raw_affiliation_strings":["Lehrstuhl Informatik II, Universita\u0308t Dortmund, D-44221 Dortmund, Germany","Lehrstuhl Informatik II, Universit\u00e4t Dortmund, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl Informatik II, Universita\u0308t Dortmund, D-44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Lehrstuhl Informatik II, Universit\u00e4t Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111723650","display_name":"Hanno Lefmann","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hanno Lefmann","raw_affiliation_strings":["Lehrstuhl Informatik II, Universita\u0308t Dortmund, D-44221 Dortmund, Germany","Lehrstuhl Informatik II, Universit\u00e4t Dortmund, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl Informatik II, Universita\u0308t Dortmund, D-44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Lehrstuhl Informatik II, Universit\u00e4t Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109240751"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":0.5419,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.64800031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"9","issue":"1-2","first_page":"163","last_page":"175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998999834060669,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7372352480888367},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6719902157783508},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5570745468139648},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5511995553970337},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5181490182876587},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5114006400108337},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4967520833015442},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"Combinatorial algorithms","score":0.44963735342025757},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44898349046707153},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4230250120162964},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31595176458358765}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7372352480888367},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6719902157783508},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5570745468139648},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5511995553970337},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5181490182876587},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5114006400108337},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4967520833015442},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.44963735342025757},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44898349046707153},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4230250120162964},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31595176458358765},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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.1002/(sici)1098-2418(199608/09)9:1/2<163::aid-rsa10>3.0.co;2-p","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<163::aid-rsa10>3.0.co;2-p","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W155769578","https://openalex.org/W1528077854","https://openalex.org/W1579342810","https://openalex.org/W1600183845","https://openalex.org/W1996672997","https://openalex.org/W1996811231","https://openalex.org/W2002958365","https://openalex.org/W2030087828","https://openalex.org/W2032146159","https://openalex.org/W2033096960","https://openalex.org/W2038562737","https://openalex.org/W2050532143","https://openalex.org/W2068871408","https://openalex.org/W2074645046","https://openalex.org/W2085716675","https://openalex.org/W2097277086","https://openalex.org/W2159739530"],"related_works":["https://openalex.org/W2060058676","https://openalex.org/W4377372033","https://openalex.org/W1998402272","https://openalex.org/W2095809912","https://openalex.org/W2385671392","https://openalex.org/W2610737932","https://openalex.org/W4305006088","https://openalex.org/W2245479836","https://openalex.org/W2383129606","https://openalex.org/W2042289434"],"abstract_inverted_index":{"The":[0,153],"k-MAXCUT":[1],"problem":[2,45],"for":[3,62],"undirected":[4],"graphs":[5,119],"G":[6],"=":[7,16,76,116],"(V,":[8],"E)":[9],"consists":[10],"of":[11,27,52,74,110,130,151],"finding":[12],"a":[13,40,89,102,108],"partition":[14],"V":[15,21],"V1":[17],"U":[18,20],"\u2026":[19],"k":[22,75,115,142],"such":[23],"that":[24,48,80],"the":[25,49,72,148],"number":[26],"edges":[28],"with":[29,120],"endpoints":[30],"in":[31],"two":[32],"different":[33],"sets":[34],"Vi":[35],"is":[36,147],"maximized.":[37],"We":[38],"offer":[39],"new":[41],"approach":[42],"to":[43,58,126,159],"this":[44],"by":[46,87],"showing":[47],"combinatorial":[50],"notion":[51],"block":[53],"designs":[54],"can":[55,84,155],"be":[56,85,157],"used":[57],"algorithmically":[59],"obtain":[60],"partitions":[61,129],"which":[63,94,106],"until":[64],"now":[65],"only":[66],"existence":[67],"proofs":[68],"were":[69],"known.":[70],"In":[71,98],"case":[73],"2,":[77],"we":[78,100,123],"show":[79],"already":[81],"known":[82],"approaches":[83],"improved":[86],"giving":[88],"simpler":[90],"linear":[91,103],"time":[92,104],"algorithm":[93,105],"yields":[95],"better":[96],"bounds.":[97],"particular,":[99],"give":[101],"achieves":[107],"bound":[109],"Edwards":[111],"[12].":[112],"For":[113],"general":[114],"2l":[117],"and":[118],"m":[121,132],"edges,":[122],"are":[124],"able":[125],"compute":[127],"efficiently":[128],"size":[131],"\u00b7":[133,137],"(k":[134],"\u2212":[135,143],"1)/k":[136],"(1":[138],"+":[139,141],"1/(\u0394":[140],"1)),":[144],"where":[145],"\u0394":[146],"maximum":[149],"degree":[150],"G.":[152],"algorithms":[154],"also":[156],"applied":[158],"weighted":[160],"graphs.":[161],"\u00a9":[162],"1996":[163],"John":[164],"Wiley":[165],"&":[166],"Sons,":[167],"Inc.":[168]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}