{"id":"https://openalex.org/W4288388962","doi":"https://doi.org/10.1109/jcsse54890.2022.9836261","title":"MAX-CUT on Samplings of Dense Graphs","display_name":"MAX-CUT on Samplings of Dense Graphs","publication_year":2022,"publication_date":"2022-06-22","ids":{"openalex":"https://openalex.org/W4288388962","doi":"https://doi.org/10.1109/jcsse54890.2022.9836261"},"language":"en","primary_location":{"id":"doi:10.1109/jcsse54890.2022.9836261","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jcsse54890.2022.9836261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 19th International Joint Conference on Computer Science and Software Engineering (JCSSE)","raw_type":"proceedings-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/A5083727723","display_name":"Jittat Fakcharoenphol","orcid":"https://orcid.org/0000-0002-7859-8079"},"institutions":[{"id":"https://openalex.org/I198105771","display_name":"Kasetsart University","ror":"https://ror.org/05gzceg21","country_code":"TH","type":"education","lineage":["https://openalex.org/I198105771"]}],"countries":["TH"],"is_corresponding":true,"raw_author_name":"Jittat Fakcharoenphol","raw_affiliation_strings":["Kasetsart University,Department of Computer Engineering,Bangkok,Thailand","Department of Computer Engineering, Kasetsart University, Bangkok, Thailand"],"affiliations":[{"raw_affiliation_string":"Kasetsart University,Department of Computer Engineering,Bangkok,Thailand","institution_ids":["https://openalex.org/I198105771"]},{"raw_affiliation_string":"Department of Computer Engineering, Kasetsart University, Bangkok, Thailand","institution_ids":["https://openalex.org/I198105771"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040311838","display_name":"Phanu Vajanopath","orcid":null},"institutions":[{"id":"https://openalex.org/I198105771","display_name":"Kasetsart University","ror":"https://ror.org/05gzceg21","country_code":"TH","type":"education","lineage":["https://openalex.org/I198105771"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Phanu Vajanopath","raw_affiliation_strings":["Kasetsart University,Department of Computer Engineering,Bangkok,Thailand","Department of Computer Engineering, Kasetsart University, Bangkok, Thailand"],"affiliations":[{"raw_affiliation_string":"Kasetsart University,Department of Computer Engineering,Bangkok,Thailand","institution_ids":["https://openalex.org/I198105771"]},{"raw_affiliation_string":"Department of Computer Engineering, Kasetsart University, Bangkok, Thailand","institution_ids":["https://openalex.org/I198105771"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083727723"],"corresponding_institution_ids":["https://openalex.org/I198105771"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10401419,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973000288009644,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9968000054359436,"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/combinatorics","display_name":"Combinatorics","score":0.6214801073074341},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47884464263916016},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4650239944458008},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4202863574028015},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3885679841041565},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36550667881965637},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35051584243774414}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6214801073074341},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47884464263916016},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4650239944458008},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4202863574028015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3885679841041565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36550667881965637},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35051584243774414}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jcsse54890.2022.9836261","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jcsse54890.2022.9836261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 19th International Joint Conference on Computer Science and Software Engineering (JCSSE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W155769578","https://openalex.org/W1970630090","https://openalex.org/W1973652906","https://openalex.org/W1985123706","https://openalex.org/W2014087252","https://openalex.org/W2024128809","https://openalex.org/W2024281442","https://openalex.org/W2038225707","https://openalex.org/W2065641139","https://openalex.org/W2066979869","https://openalex.org/W2068888615","https://openalex.org/W2072858942","https://openalex.org/W2087038607","https://openalex.org/W2090304146","https://openalex.org/W2109694798","https://openalex.org/W2112397134","https://openalex.org/W2164530213","https://openalex.org/W2401610261","https://openalex.org/W3132069259","https://openalex.org/W4233413206","https://openalex.org/W4242357733","https://openalex.org/W6606391825","https://openalex.org/W6667148630","https://openalex.org/W6676599424","https://openalex.org/W6790913590"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2980963558","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W3111310291"],"abstract_inverted_index":{"The":[0],"maximum":[1],"cut":[2],"problem":[3],"finds":[4],"a":[5,8,37,46,119,146],"partition":[6],"of":[7,14,56,150],"graph":[9,19,74,86,99],"that":[10,35],"maximizes":[11],"the":[12,18,57,157,162],"number":[13],"crossing":[15],"edges.":[16],"When":[17],"is":[20,23,50,110],"dense":[21,85,126],"or":[22],"sampled":[24,81],"based":[25],"on":[26],"certain":[27],"planted":[28,163],"assumptions,":[29],"there":[30],"exist":[31],"polynomial-time":[32],"approximation":[33],"schemes":[34],"given":[36],"fixed":[38],"<tex":[39,53,75,87,93,100,104,131,137,153],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[40,54,76,88,94,101,105,132,138,154],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\epsilon":[41],"&gt;":[42],"0$</tex>":[43],".,":[44],"find":[45,129],"solution":[47,135],"whose":[48,78],"value":[49],"at":[51],"least":[52],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$1-\\epsilon$</tex>":[55],"optimal":[58],"value.":[59],"This":[60],"paper":[61],"presents":[62],"another":[63],"random":[64],"model":[65,159],"relating":[66],"to":[67,117,128],"both":[68],"successful":[69],"cases.":[70],"Consider":[71],"an":[72,83,130],"n-vertex":[73],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$G$</tex>":[77,102,139],"edges":[79,108],"are":[80],"from":[82],"unknown":[84],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$H$</tex>":[89],"independently":[90],"with":[91],"probability":[92,152],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$p=\\Omega(1/\\sqrt{\\log":[95],"n});$</tex>":[96],"this":[97],"input":[98],"has":[103],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(n^{2}/\\sqrt{\\log":[106],"n})$</tex>":[107],"and":[109],"no":[111],"longer":[112],"dense.":[113],"We":[114],"show":[115],"how":[116],"modify":[118],"PTAS":[120],"by":[121],"de":[122],"la":[123],"Vega":[124],"for":[125,136,145],"graphs":[127],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$(1-\\epsilon)$</tex>":[133],"-approximate":[134],".":[140],"Although":[141],"our":[142],"algorithm":[143],"works":[144],"very":[147],"narrow":[148],"range":[149],"sampling":[151,158],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$p$</tex>":[155],",":[156],"itself":[160],"generalizes":[161],"models":[164],"fairly":[165],"well.":[166]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}