{"id":"https://openalex.org/W1996811231","doi":"https://doi.org/10.1017/s0963548300000596","title":"Linear-Time Approximation Algorithms for the Max Cut Problem","display_name":"Linear-Time Approximation Algorithms for the Max Cut Problem","publication_year":1993,"publication_date":"1993-06-01","ids":{"openalex":"https://openalex.org/W1996811231","doi":"https://doi.org/10.1017/s0963548300000596","mag":"1996811231"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548300000596","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300000596","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5108531795","display_name":"Nguy\u1ec5n V\u0103n Ng\u1ecdc","orcid":null},"institutions":[{"id":"https://openalex.org/I49382586","display_name":"An Giang University","ror":"https://ror.org/023pm6532","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I49382586"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Nguyen van Ngoc","raw_affiliation_strings":["Fl C20 Kim Giang, Dong Da \u2013 Ha Noi, Viet Nam","\u2020 Fl C20 Kim Giang, Dong Da \u2013 Ha Noi, Viet Nam"],"affiliations":[{"raw_affiliation_string":"Fl C20 Kim Giang, Dong Da \u2013 Ha Noi, Viet Nam","institution_ids":["https://openalex.org/I49382586"]},{"raw_affiliation_string":"\u2020 Fl C20 Kim Giang, Dong Da \u2013 Ha Noi, Viet Nam","institution_ids":["https://openalex.org/I49382586"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026437192","display_name":"\u0179solt Tuza","orcid":"https://orcid.org/0000-0003-3235-9221"},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zsolt Tuza","raw_affiliation_strings":["Computer and Automation Institute, Hungarian Academy of Sciences, H-llll Budapest, Kende u. 13-17, Hungary","Computer and Automation Institute, Hungarian Academy of Sciences, H-llll Budapest, Kende u. 13\u201317, Hungary"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Institute, Hungarian Academy of Sciences, H-llll Budapest, Kende u. 13-17, Hungary","institution_ids":["https://openalex.org/I7597260"]},{"raw_affiliation_string":"Computer and Automation Institute, Hungarian Academy of Sciences, H-llll Budapest, Kende u. 13\u201317, Hungary","institution_ids":["https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108531795"],"corresponding_institution_ids":["https://openalex.org/I49382586"],"apc_list":null,"apc_paid":null,"fwci":2.0338,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.85425293,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2","issue":"2","first_page":"201","last_page":"210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9955999851226807,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9955999851226807,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9932000041007996,"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/T12288","display_name":"Optimization and Search Problems","score":0.982699990272522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8868868350982666},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7226940989494324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6883019208908081},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5188835263252258},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5024456977844238},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4633878171443939},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.444964200258255},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.43281638622283936},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4202784299850464},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3640464246273041},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3119211792945862},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.10270366072654724},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.0910661518573761}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8868868350982666},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7226940989494324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6883019208908081},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5188835263252258},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5024456977844238},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4633878171443939},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.444964200258255},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.43281638622283936},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4202784299850464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3640464246273041},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3119211792945862},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.10270366072654724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0910661518573761},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548300000596","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300000596","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322192","display_name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","ror":"https://ror.org/02ks8qq67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1562917120","https://openalex.org/W1996672997","https://openalex.org/W2004435872","https://openalex.org/W2011039300","https://openalex.org/W2021529197","https://openalex.org/W2033096960","https://openalex.org/W2038562737","https://openalex.org/W2161439427","https://openalex.org/W2312821511","https://openalex.org/W2989103922","https://openalex.org/W3084987570","https://openalex.org/W4229970255","https://openalex.org/W6658509770"],"related_works":["https://openalex.org/W2091826982","https://openalex.org/W2036057584","https://openalex.org/W2107875203","https://openalex.org/W245205139","https://openalex.org/W2921162226","https://openalex.org/W4234658180","https://openalex.org/W4300919538","https://openalex.org/W2949735222","https://openalex.org/W2167462019","https://openalex.org/W2071364952"],"abstract_inverted_index":{"Let":[0],"G":[1,43,59,70,78,102],"be":[2,20,145],"a":[3,39,55,74,170,176],"connected":[4],"graph":[5,171],"with":[6,27,44,60,79,172,180],"n":[7,50,66,88],"vertices":[8],"and":[9,15,101,162,197],"m":[10,34,46,62,81,83,139,141,148,150,155,173,183,185,190],"edges":[11,13,68,96,174],"(multiple":[12],"allowed),":[14],"let":[16],"k":[17,85,90,93,98,143,152,177,187,194],"\u2265":[18,45,61,80,99,195],"2":[19,196],"an":[21,25],"integer.":[22],"There":[23],"is":[24,71,103,164],"algorithm":[26],"(optimal)":[28],"running":[29],"time":[30],"of":[31,42,58,77,108,113,138],"O":[32],"(":[33,49,87,92],")":[35],"that":[36,111],"finds":[37],"(i)":[38],"bipartite":[40,56],"subgraph":[41,57,76,179],"/2":[47,63],"+":[48,64,86,91,153,188],"\u2212":[51,82,94,140,149,184],"1)/4":[52],"edges,":[53,191],"(ii)":[54],"3(":[65],"\u22121)/8":[67],"if":[69,97,129],"triangle-free,":[72],"(iii)":[73],"k-colourable":[75],"/":[84,142,151,186],"\u22121)/":[89],"3)/2":[95],"3":[100],"not":[104],"k-colorable.":[105],"Infinite":[106],"families":[107],"graphs":[109],"show":[110],"each":[112],"those":[114],"lower":[115,136],"bounds":[116],"on":[117],"the":[118,134],"worst-case":[119],"performance":[120],"are":[121,132],"best":[122],"possible":[123],"(for":[124],"every":[125],"algorithm).":[126],"Moreover,":[127],"even":[128],"short":[130],"cycles":[131],"excluded,":[133],"general":[135],"bound":[137],"cannot":[144],"replaced":[146],"by":[147],"\u03b5":[154,159,189,200],"for":[156,192],"any":[157,193],"fixed":[158],">":[160],"0;":[161],"it":[163],"NP":[165],"-complete":[166],"to":[167],"decide":[168],"whether":[169],"contains":[175],"-colorable":[178],"more":[181],"than":[182],"\u03b5>":[198],"0,":[199],"<":[201],"1/":[202],"k.":[203]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}