{"id":"https://openalex.org/W4409704918","doi":"https://doi.org/10.1007/s10107-025-02209-0","title":"A primal-dual extension of the Goemans\u2013Williamson algorithm for the weighted fractional cut-covering problem","display_name":"A primal-dual extension of the Goemans\u2013Williamson algorithm for the weighted fractional cut-covering problem","publication_year":2025,"publication_date":"2025-04-23","ids":{"openalex":"https://openalex.org/W4409704918","doi":"https://doi.org/10.1007/s10107-025-02209-0"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-025-02209-0","doi":"https://doi.org/10.1007/s10107-025-02209-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-025-02209-0","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,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"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"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2311.15346","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066093832","display_name":"Nathan Benedetto Proen\u00e7a","orcid":"https://orcid.org/0009-0002-5623-858X","observed_orcids":["https://orcid.org/0009-0002-5623-858X"]},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Nathan Benedetto Proen\u00e7a","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada"],"raw_orcid":"https://orcid.org/0009-0002-5623-858X","affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056193235","display_name":"Marcel K. de Carli Silva","orcid":"https://orcid.org/0000-0002-0466-4280","observed_orcids":["https://orcid.org/0000-0002-0466-4280"]},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcel K. de Carli Silva","raw_affiliation_strings":["Institute of Mathematics and Statistics, University of S\u00e3o Paulo, S\u00e3o Paulo, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-0466-4280","affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Statistics, University of S\u00e3o Paulo, S\u00e3o Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029838252","display_name":"Cristiane M. Sato","orcid":"https://orcid.org/0000-0002-1948-2957","observed_orcids":["https://orcid.org/0000-0002-1948-2957"]},"institutions":[{"id":"https://openalex.org/I71715416","display_name":"Universidade Federal do ABC","ror":"https://ror.org/028kg9j04","country_code":"BR","type":"education","lineage":["https://openalex.org/I71715416"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Cristiane M. Sato","raw_affiliation_strings":["Center for Mathematics, Computing and Cognition, Federal University of ABC Region, Santo Andr\u00e9, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-1948-2957","affiliations":[{"raw_affiliation_string":"Center for Mathematics, Computing and Cognition, Federal University of ABC Region, Santo Andr\u00e9, Brazil","institution_ids":["https://openalex.org/I71715416"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062941227","display_name":"Levent Tun\u00e7el","orcid":"https://orcid.org/0000-0001-5071-216X","observed_orcids":["https://orcid.org/0000-0001-5071-216X"]},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Levent Tun\u00e7el","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada"],"raw_orcid":"https://orcid.org/0000-0001-5071-216X","affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066093832"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":null,"fwci":1.1684,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71295773,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"215","issue":"1-2","first_page":"1","last_page":"56"},"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.9970999956130981,"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.9970999956130981,"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":0.0020000000949949026,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.00019999999494757503,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-cut-problem","display_name":"max-cut problem","score":0.9620000123977661},{"id":"https://openalex.org/keywords/goemans-williamson-algorithm","display_name":"Goemans-Williamson algorithm","score":0.9710000157356262},{"id":"https://openalex.org/keywords/semidefinite-relaxation","display_name":"semidefinite relaxation","score":0.9020000100135803},{"id":"https://openalex.org/keywords/gauge-duality","display_name":"gauge duality","score":0.9959999918937683},{"id":"https://openalex.org/keywords/primal-dual-approximation","display_name":"primal-dual approximation","score":0.8420000076293945},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6830000281333923},{"id":"https://openalex.org/keywords/geometric-graph-representation","display_name":"geometric graph representation","score":0.5680000185966492}],"concepts":[{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.8406199216842651},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8255287408828735},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.7059986591339111},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49776342511177063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4513954818248749},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4346935451030731},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3917219936847687},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34753453731536865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11094841361045837},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06882399320602417},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10107-025-02209-0","doi":"https://doi.org/10.1007/s10107-025-02209-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-025-02209-0","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,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"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:arXiv.org:2311.15346","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2311.15346","pdf_url":"https://arxiv.org/pdf/2311.15346","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.2311.15346","doi":"https://doi.org/10.48550/arxiv.2311.15346","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2311.15346","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2311.15346","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2311.15346","pdf_url":"https://arxiv.org/pdf/2311.15346","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409704918.pdf","grobid_xml":"https://content.openalex.org/works/W4409704918.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W54441373","https://openalex.org/W126388424","https://openalex.org/W247697463","https://openalex.org/W641613623","https://openalex.org/W1564025554","https://openalex.org/W1612749533","https://openalex.org/W1639981145","https://openalex.org/W1755257097","https://openalex.org/W1985123706","https://openalex.org/W1985476702","https://openalex.org/W1994229647","https://openalex.org/W1999834501","https://openalex.org/W2012329067","https://openalex.org/W2012937096","https://openalex.org/W2031481696","https://openalex.org/W2040721698","https://openalex.org/W2043506441","https://openalex.org/W2045148236","https://openalex.org/W2049716158","https://openalex.org/W2058772615","https://openalex.org/W2066492681","https://openalex.org/W2069816168","https://openalex.org/W2072848654","https://openalex.org/W2078289947","https://openalex.org/W2082001376","https://openalex.org/W2085595139","https://openalex.org/W2087038607","https://openalex.org/W2092812429","https://openalex.org/W2093546055","https://openalex.org/W2114189119","https://openalex.org/W2146489710","https://openalex.org/W2246801328","https://openalex.org/W2401610261","https://openalex.org/W2593282843","https://openalex.org/W2939890945","https://openalex.org/W2964117365","https://openalex.org/W2989841544","https://openalex.org/W3016023902","https://openalex.org/W3209227036","https://openalex.org/W3216274422","https://openalex.org/W4301168154","https://openalex.org/W4400141371"],"related_works":["https://openalex.org/W7155049383","https://openalex.org/W4400141371","https://openalex.org/W7097036928","https://openalex.org/W956804560","https://openalex.org/W1756950477","https://openalex.org/W2939890945","https://openalex.org/W7096107808","https://openalex.org/W2022589731","https://openalex.org/W2211522879","https://openalex.org/W7095349590"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2025-04-24T00:00:00"}