{"id":"https://openalex.org/W2100553789","doi":"https://doi.org/10.1007/s10107-005-0604-5","title":"Exploring the Relationship Between Max-Cut and Stable Set Relaxations","display_name":"Exploring the Relationship Between Max-Cut and Stable Set Relaxations","publication_year":2005,"publication_date":"2005-06-07","ids":{"openalex":"https://openalex.org/W2100553789","doi":"https://doi.org/10.1007/s10107-005-0604-5","mag":"2100553789"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-005-0604-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-005-0604-5","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5021126920","display_name":"Monia Giandomenico","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Monia Giandomenico","raw_affiliation_strings":["Dipartimento di Statistica, Universit\u00e0 La Sapienza, Roma, Italy","Dipartimento di Statistica, Universit\u00e0 La Sapienza, Roma, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Statistica, Universit\u00e0 La Sapienza, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dipartimento di Statistica, Universit\u00e0 La Sapienza, Roma, Italy#TAB#","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004954937","display_name":"Adam N. Letchford","orcid":"https://orcid.org/0000-0002-3191-5006"},"institutions":[{"id":"https://openalex.org/I67415387","display_name":"Lancaster University","ror":"https://ror.org/04f2nsd36","country_code":"GB","type":"education","lineage":["https://openalex.org/I67415387"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Adam N. Letchford","raw_affiliation_strings":["Department of Management Science, Lancaster University Management School, Lancaster, LA1 4YW, United Kingdom","Department of Management Science, Lancaster University Management School, LA1 4YW, Lancaster, United Kingdom#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Management Science, Lancaster University Management School, Lancaster, LA1 4YW, United Kingdom","institution_ids":["https://openalex.org/I67415387"]},{"raw_affiliation_string":"Department of Management Science, Lancaster University Management School, LA1 4YW, Lancaster, United Kingdom#TAB#","institution_ids":["https://openalex.org/I67415387"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021126920"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.6733,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.72566244,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"106","issue":"1","first_page":"159","last_page":"175"},"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.9998000264167786,"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.9998000264167786,"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.9973999857902527,"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.9937000274658203,"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/polytope","display_name":"Polytope","score":0.8768759965896606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8330608010292053},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7023205161094666},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.556167483329773},{"id":"https://openalex.org/keywords/birkhoff-polytope","display_name":"Birkhoff polytope","score":0.5391981601715088},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5208226442337036},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5140365362167358},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5080461502075195},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43620288372039795},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4289141893386841},{"id":"https://openalex.org/keywords/polyhedral-combinatorics","display_name":"Polyhedral combinatorics","score":0.42526349425315857},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4208434224128723},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.41511857509613037},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.41430723667144775},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.37136173248291016},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3448137044906616},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.29205846786499023},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1836572289466858},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09082448482513428},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0858663022518158}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8768759965896606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8330608010292053},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7023205161094666},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.556167483329773},{"id":"https://openalex.org/C206304794","wikidata":"https://www.wikidata.org/wiki/Q4916482","display_name":"Birkhoff polytope","level":5,"score":0.5391981601715088},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5208226442337036},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5140365362167358},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5080461502075195},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43620288372039795},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4289141893386841},{"id":"https://openalex.org/C174248988","wikidata":"https://www.wikidata.org/wiki/Q8348314","display_name":"Polyhedral combinatorics","level":5,"score":0.42526349425315857},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4208434224128723},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.41511857509613037},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.41430723667144775},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.37136173248291016},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3448137044906616},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.29205846786499023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1836572289466858},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09082448482513428},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0858663022518158},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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":3,"locations":[{"id":"doi:10.1007/s10107-005-0604-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-005-0604-5","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.100.8870","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.8870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lancs.ac.uk/staff/letchfoa/articles/cutprojection.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.lancs.ac.uk:44078","is_oa":false,"landing_page_url":"https://eprints.lancs.ac.uk/id/eprint/44078/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401916","display_name":"Lancaster EPrints (Lancaster University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67415387","host_organization_name":"Lancaster University","host_organization_lineage":["https://openalex.org/I67415387"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W51435562","https://openalex.org/W171715212","https://openalex.org/W1501644705","https://openalex.org/W1976962893","https://openalex.org/W1985123706","https://openalex.org/W1997998268","https://openalex.org/W2000920559","https://openalex.org/W2006934540","https://openalex.org/W2012605254","https://openalex.org/W2018145024","https://openalex.org/W2047609571","https://openalex.org/W2058497129","https://openalex.org/W2059909742","https://openalex.org/W2066492681","https://openalex.org/W2072848654","https://openalex.org/W2078289947","https://openalex.org/W2081254453","https://openalex.org/W2084788931","https://openalex.org/W2085647652","https://openalex.org/W2100440346","https://openalex.org/W2106264302","https://openalex.org/W2114189119","https://openalex.org/W2158907148","https://openalex.org/W2249755937","https://openalex.org/W2598139359"],"related_works":["https://openalex.org/W2066333776","https://openalex.org/W4301600724","https://openalex.org/W4298021137","https://openalex.org/W1973648690","https://openalex.org/W2084236013","https://openalex.org/W29206020","https://openalex.org/W2510190638","https://openalex.org/W1979954284","https://openalex.org/W2622142234","https://openalex.org/W2090161266"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}