{"id":"https://openalex.org/W1511510919","doi":"https://doi.org/10.1007/978-3-540-45198-3_32","title":"Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances","display_name":"Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1511510919","doi":"https://doi.org/10.1007/978-3-540-45198-3_32","mag":"1511510919"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-45198-3_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-45198-3_32","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/I2800173700","display_name":"UCL Australia","ror":"https://ror.org/024atcf19","country_code":"AU","type":"education","lineage":["https://openalex.org/I2800173700"]},{"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":["AU","GB"],"is_corresponding":false,"raw_author_name":"Alexander D. Scott","raw_affiliation_strings":["Department of Mathematics, University College London, London, UK","Department of Mathematics, University College London, London, WC1E 6BT, UK","University college London"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University College London, London, UK","institution_ids":["https://openalex.org/I45129253"]},{"raw_affiliation_string":"Department of Mathematics, University College London, London, WC1E 6BT, UK","institution_ids":["https://openalex.org/I45129253"]},{"raw_affiliation_string":"University college London","institution_ids":["https://openalex.org/I2800173700"]}]},{"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"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"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","Department of Mathematical Sciences, IBM T.J. Watson Research Center, Yorktown Heights, USA","IBM T.J. Watson research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, IBM T.J. Watson Research Center, Yorktown Heights, NY, 10598, USA","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematical Sciences, IBM T.J. Watson Research Center, Yorktown Heights, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM T.J. Watson research Center","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.9673,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.9518783,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"382","last_page":"395"},"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.9991000294685364,"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.9991000294685364,"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.9976000189781189,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9970999956130981,"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/time-complexity","display_name":"Time complexity","score":0.6920173168182373},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6410816311836243},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6328356266021729},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6040588617324829},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5737022161483765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5003674030303955},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47099465131759644},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4700191020965576},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.46490156650543213},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4338594377040863},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36208388209342957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3250783085823059}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6920173168182373},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6410816311836243},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6328356266021729},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6040588617324829},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5737022161483765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5003674030303955},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47099465131759644},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4700191020965576},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.46490156650543213},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4338594377040863},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36208388209342957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3250783085823059},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-540-45198-3_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-45198-3_32","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:eprints.lse.ac.uk:35818","is_oa":false,"landing_page_url":"https://orcid.org/0000-0003-4935-7820>","pdf_url":null,"source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.308.7953","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.7953","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.maths.ox.ac.uk/scott/Papers/fasteralg.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:189257","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/189257/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In: Arora, S and Jansen, K and Rolim, JDP and Sahai, A, (eds.)  (Proceedings) 6th Int Workshop on Approximation Algorithms for Combinatorial Optimization Problems/7th Int Workshop on Randomization and Approximation Techniques in Computer Science. (pp. pp. 382-395).  SPRINGER-VERLAG BERLIN (2003)     ","raw_type":"Proceedings paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W390146837","https://openalex.org/W1492831324","https://openalex.org/W1557184511","https://openalex.org/W1966384494","https://openalex.org/W1969966778","https://openalex.org/W2006424894","https://openalex.org/W2018251959","https://openalex.org/W2036185701","https://openalex.org/W2097532582","https://openalex.org/W2138778293","https://openalex.org/W2146489710","https://openalex.org/W2905110430"],"related_works":["https://openalex.org/W3020890412","https://openalex.org/W1524973174","https://openalex.org/W2580986343","https://openalex.org/W2102858635","https://openalex.org/W1588356204","https://openalex.org/W2046178780","https://openalex.org/W4246688532","https://openalex.org/W2129131081","https://openalex.org/W139348750","https://openalex.org/W4361194499"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}