乐胖代购免代理版

{"id":"https://openalex.org/W1988547891","doi":"https://doi.org/10.1017/s096354830500725x","title":"Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time","display_name":"Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time","publication_year":2006,"publication_date":"2006-01-03","ids":{"openalex":"https://openalex.org/W1988547891","doi":"https://doi.org/10.1017/s096354830500725x","mag":"1988547891"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1017/s096354830500725x","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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5022035980","display_name":"Alex Scott","orcid":"https://orcid.org/0000-0003-0366-8404"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"ALEXANDER D. SCOTT","raw_affiliation_strings":["Department of Mathematics, University College London, London WC1E 6BT, UK (e-mail: scott@math.ucl.ac.uk)"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University College London, London WC1E 6BT, UK (e-mail: scott@math.ucl.ac.uk)","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083890565","display_name":"Gregory B. Sorkin","orcid":"https://orcid.org/0000-0003-4935-7820"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"GREGORY B. SORKIN","raw_affiliation_strings":["Department of Mathematical Sciences, IBM T.J. Watson Research Center, Yorktown Heights NY 10598, USA (e-mail: sorkin@watson.ibm.com)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, IBM T.J. Watson Research Center, Yorktown Heights NY 10598, USA (e-mail: sorkin@watson.ibm.com)#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.938,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.918356,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":92},"biblio":{"volume":"15","issue":"1-2","first_page":"281","last_page":"281"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9999,"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.9999,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9992,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9988,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6727127}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.751443},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.71312773},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6727127},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5837418},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.500602},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49245295},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.47086278},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46878493},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40969193},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11095506},{"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1017/s096354830500725x","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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":28,"referenced_works":["https://openalex.org/W1486613786","https://openalex.org/W1490436385","https://openalex.org/W1491051759","https://openalex.org/W1492831324","https://openalex.org/W1511510919","https://openalex.org/W1557184511","https://openalex.org/W1766902308","https://openalex.org/W1784269369","https://openalex.org/W1975340857","https://openalex.org/W1986766834","https://openalex.org/W2006424894","https://openalex.org/W2018251959","https://openalex.org/W2020658897","https://openalex.org/W2025027844","https://openalex.org/W2036185701","https://openalex.org/W2056513564","https://openalex.org/W2069802496","https://openalex.org/W2086449672","https://openalex.org/W2097532582","https://openalex.org/W2103012681","https://openalex.org/W2109767783","https://openalex.org/W2121373282","https://openalex.org/W2138778293","https://openalex.org/W2146489710","https://openalex.org/W2165341195","https://openalex.org/W2332440313","https://openalex.org/W2335459461","https://openalex.org/W3144881883"],"related_works":["https://openalex.org/W4291863732","https://openalex.org/W2952342369","https://openalex.org/W2610737932","https://openalex.org/W2392841491","https://openalex.org/W2385671392","https://openalex.org/W2383129606","https://openalex.org/W2073908095","https://openalex.org/W2042289434","https://openalex.org/W1988547891","https://openalex.org/W139348750"],"abstract_inverted_index":{"We":[0,68],"show":[1,69],"that":[2,70],"a":[3,7,25,33,72,82,86,105,108],"maximum":[4,61],"cut":[5],"of":[6,37,98,101,107,122],"random":[8,83,109,127],"graph":[9,79,84,110],"below":[10],"the":[11,30,91,96,99],"giant-component":[12],"threshold":[13],"can":[14],"be":[15],"found":[16],"in":[17],"linear":[18,21],"space":[19],"and":[20,64,125],"expected":[22],"time":[23],"by":[24],"simple":[26,126],"algorithm.":[27],"In":[28,45],"fact,":[29],"algorithm":[31],"solves":[32],"more":[34],"general":[35],"class":[36],"problems,":[38],"namely":[39],"binary":[40],"2-variable":[41],"constraint":[42],"satisfaction":[43],"problems.":[44],"addition":[46],"to":[47],"Max":[48,51,54,56,58,73],"Cut,":[49],"such":[50],"2-CSPs":[52],"encompass":[53],"Dicut,":[55],"2-Lin,":[57],"2-Sat,":[59],"Max-Ones-2-Sat,":[60],"independent":[62],"set,":[63],"minimum":[65],"vertex":[66],"cover.":[67],"if":[71],"2-CSP":[74],"instance":[75],"has":[76],"an":[77],"\u2018underlying\u2019":[78],"which":[80],"is":[81,85],"deterministic":[87],"upper":[88],"bound":[89],"on":[90],"solution":[92],"time.":[93],"Then,":[94],"analysing":[95],"tails":[97],"distribution":[100],"this":[102,115],"quantity":[103],"for":[104],"component":[106],"yields":[111],"our":[112],"result.":[113],"Towards":[114],"end":[116],"we":[117],"derive":[118],"some":[119],"useful":[120],"properties":[121],"binomial":[123],"distributions":[124],"walks.":[128]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1988547891","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2024-12-13T01:00:26.160746","created_date":"2016-06-24"}