{"id":"https://openalex.org/W2963382491","doi":null,"title":"Combinatorial Approximation Algorithms for MAXCUT using Random Walks.","display_name":"Combinatorial Approximation Algorithms for MAXCUT using Random Walks.","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2963382491","mag":"2963382491"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.352.5164","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.5164","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.satyenkale.com/papers/maxcut.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.osti.gov/biblio/1121047","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114021051","display_name":"Satyen Kale","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1325784139","display_name":"Yahoo (United Kingdom)","ror":"https://ror.org/038p3gq39","country_code":"GB","type":"company","lineage":["https://openalex.org/I1325784139","https://openalex.org/I4210134091"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Satyen Kale","raw_affiliation_strings":["Yahoo (United Kingdom), London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yahoo (United Kingdom), London, United Kingdom","institution_ids":["https://openalex.org/I1325784139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038687804","display_name":"Comandur Seshadhri","orcid":"https://orcid.org/0000-0003-2163-3555","observed_orcids":["https://orcid.org/0000-0003-2163-3555"]},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Seshadhri","raw_affiliation_strings":["Sandia National  Laboratories"],"raw_orcid":"https://orcid.org/0000-0003-2163-3555","affiliations":[{"raw_affiliation_string":"Sandia National  Laboratories","institution_ids":["https://openalex.org/I4210104735"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4935,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.93259416,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"367","last_page":"388"},"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.9990000128746033,"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.9990000128746033,"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":9.999999747378752e-05,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.9879999756813049},{"id":"https://openalex.org/keywords/combinatorial-approximation-algorithms","display_name":"combinatorial approximation algorithms","score":0.9559999704360962},{"id":"https://openalex.org/keywords/random-walks","display_name":"random walks","score":0.972000002861023},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.7689999938011169},{"id":"https://openalex.org/keywords/conductance","display_name":"conductance","score":0.8759999871253967},{"id":"https://openalex.org/keywords/sublinear-algorithms","display_name":"sublinear-time algorithms","score":0.7960000038146973}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7506250143051147},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6745156645774841},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.652678906917572},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6430237293243408},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.6378235816955566},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6231110692024231},{"id":"https://openalex.org/C121932024","wikidata":"https://www.wikidata.org/wiki/Q5159376","display_name":"Conductance","level":2,"score":0.5585094690322876},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5277004241943359},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.48487862944602966},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4679965376853943},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46706634759902954},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4428720474243164},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4302408695220947},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3584633469581604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.318952351808548},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1025867760181427},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0772792398929596},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.352.5164","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.5164","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.satyenkale.com/papers/maxcut.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.740.6020","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.740.6020","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1008.3938.pdf","raw_type":"text"},{"id":"pmh:oai:osti.gov:1121047","doi":null,"is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1121047","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:osti.gov:1121060","doi":null,"is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1121060","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"mag:2963382491","doi":null,"is_oa":false,"landing_page_url":"http://www.satyenkale.com/papers/maxcut.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419857","display_name":"International Conference on Supercomputing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Supercomputing","raw_type":null}],"best_oa_location":{"id":"pmh:oai:osti.gov:1121047","doi":null,"is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1121047","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W336776360","https://openalex.org/W1559116151","https://openalex.org/W1965444148","https://openalex.org/W1967821609","https://openalex.org/W1985123706","https://openalex.org/W1995547833","https://openalex.org/W2001663593","https://openalex.org/W2033281046","https://openalex.org/W2045107949","https://openalex.org/W2050961553","https://openalex.org/W2063665970","https://openalex.org/W2084350425","https://openalex.org/W2086254934","https://openalex.org/W2088759008","https://openalex.org/W2095727035","https://openalex.org/W2109041494","https://openalex.org/W2109154425","https://openalex.org/W2113647243","https://openalex.org/W2120358419","https://openalex.org/W2140802988","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W7099901795","https://openalex.org/W2917997019","https://openalex.org/W2793269230","https://openalex.org/W1494985256","https://openalex.org/W6884993495","https://openalex.org/W7097714819","https://openalex.org/W7096033326","https://openalex.org/W3142780541","https://openalex.org/W3124833379","https://openalex.org/W7008095240"],"abstract_inverted_index":{"We":[0,45,58],"give":[1],"the":[2,11,39,43,48,89,150,159],"first":[3],"combinatorial":[4],"approximation":[5,54],"algorithm":[6,70,93],"for":[7,61,77],"MAXCUT":[8],"that":[9,60,71,101],"beats":[10],"trivial":[12],"0.5":[13],"factor":[14],"by":[15],"a":[16,32,73,95,108,113,118,141],"constant.":[17,86],"The":[18,152],"main":[19],"partitioning":[20,99],"procedure":[21,100],"is":[22,67,83,94,161],"very":[23],"intuitive,":[24],"natural,":[25],"and":[26,37,112,136],"easily":[27],"described.":[28],"It":[29],"essentially":[30],"performs":[31],"number":[33],"of":[34,88,91,104,121,134,143],"random":[35,119],"walks":[36],"aggregates":[38],"information":[40],"to":[41,51,149],"provide":[42],"partition.":[44],"can":[46,139],"control":[47],"running":[49],"time":[50,56],"get":[52],"an":[53,68],"factor-running":[55],"tradeoff.":[57],"show":[59],"any":[62],"constant":[63],"b>":[64],"1.5,":[65],"there":[66],"\u00d5(nb)":[69],"outputs":[72],"(0.5":[74],"+":[75],"\u03b4)-approximation":[76],"MAXCUT,":[78],"where":[79],"\u03b4":[80],"=":[81,124],"\u03b4(b)":[82],"some":[84],"positive":[85],"One":[87],"components":[90],"our":[92],"weak":[96],"local":[97],"graph":[98],"may":[102],"be":[103],"independent":[105],"interest.":[106],"Given":[107],"starting":[109,127],"vertex":[110,156],"i":[111,129],"conductance":[114,144],"parameter":[115],"\u03c6,":[116],"unless":[117],"walk":[120],"length":[122],"\u2113":[123],"O(log":[125],"n)":[126],"from":[128],"mixes":[130],"rapidly":[131],"(in":[132],"terms":[133],"\u03c6":[135,147],"\u2113),":[137],"we":[138],"find":[140],"cut":[142,160],"at":[145],"most":[146],"close":[148],"vertex.":[151],"work":[153],"done":[154],"per":[155],"found":[157],"in":[158,163],"sublinear":[162],"n.":[164]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2019-07-30T00:00:00"}