{"id":"https://openalex.org/W2066159238","doi":"https://doi.org/10.1016/s0167-6377(97)00043-6","title":"A new and improved algorithm for the 3-cut problem","display_name":"A new and improved algorithm for the 3-cut problem","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2066159238","doi":"https://doi.org/10.1016/s0167-6377(97)00043-6","mag":"2066159238"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-6377(97)00043-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(97)00043-6","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","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/A5005621597","display_name":"Michel Burlet","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michel Burlet","raw_affiliation_strings":["Laboratoire LEIBNIZ, IMAG, Grenoble, France","Laboratoire LEIBNIZ, IMAG, Grenoble, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Laboratoire LEIBNIZ, IMAG, Grenoble, France","institution_ids":[]},{"raw_affiliation_string":"Laboratoire LEIBNIZ, IMAG, Grenoble, France#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040077103","display_name":"Olivier Goldschmidt","orcid":"https://orcid.org/0000-0002-6727-5565"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Olivier Goldschmidt","raw_affiliation_strings":["Laboratoire LEIBNIZ, IMAG, Grenoble, France","Laboratoire LEIBNIZ, IMAG, Grenoble, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Laboratoire LEIBNIZ, IMAG, Grenoble, France","institution_ids":[]},{"raw_affiliation_string":"Laboratoire LEIBNIZ, IMAG, Grenoble, France#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040077103"],"corresponding_institution_ids":[],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":2.5855,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.89484309,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"21","issue":"5","first_page":"225","last_page":"227"},"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.9965000152587891,"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.9965000152587891,"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.9958999752998352,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6088128089904785},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5359872579574585},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5081760883331299},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.46216297149658203},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45099544525146484},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4476652145385742},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4280877113342285},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4269157648086548},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4161715805530548},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3981669247150421},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18587440252304077},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13953474164009094}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6088128089904785},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5359872579574585},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5081760883331299},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.46216297149658203},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45099544525146484},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4476652145385742},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4280877113342285},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4269157648086548},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4161715805530548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3981669247150421},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18587440252304077},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13953474164009094}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0167-6377(97)00043-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(97)00043-6","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1885928367","https://openalex.org/W2035228443","https://openalex.org/W2053913299","https://openalex.org/W2167637346"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2186707160","https://openalex.org/W2903538031","https://openalex.org/W2129497110","https://openalex.org/W2115772827","https://openalex.org/W1974018476","https://openalex.org/W4289685524","https://openalex.org/W2885987986","https://openalex.org/W3184379502","https://openalex.org/W3138812705"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}