{"id":"https://openalex.org/W2795074925","doi":"https://doi.org/10.1007/s10107-018-1270-8","title":"Beating the 2-approximation factor for global bicut","display_name":"Beating the 2-approximation factor for global bicut","publication_year":2018,"publication_date":"2018-03-30","ids":{"openalex":"https://openalex.org/W2795074925","doi":"https://doi.org/10.1007/s10107-018-1270-8","mag":"2795074925"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-018-1270-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-018-1270-8","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/A5064012507","display_name":"Krist\u00f3f B\u00e9rczi","orcid":"https://orcid.org/0000-0003-0457-4573"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Krist\u00f3f B\u00e9rczi","raw_affiliation_strings":["MTA-ELTE Egerv\u00e1ry Research Group, Department of Operations Research, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MTA-ELTE Egerv\u00e1ry Research Group, Department of Operations Research, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011591780","display_name":"Karthekeyan Chandrasekaran","orcid":"https://orcid.org/0000-0002-3421-7238"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Karthekeyan Chandrasekaran","raw_affiliation_strings":["University of Illinois, Urbana-Champaign, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072284685","display_name":"Tam\u00e1s Kir\u00e1ly","orcid":"https://orcid.org/0000-0001-7218-2112"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Tam\u00e1s Kir\u00e1ly","raw_affiliation_strings":["MTA-ELTE Egerv\u00e1ry Research Group, Department of Operations Research, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MTA-ELTE Egerv\u00e1ry Research Group, Department of Operations Research, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075423314","display_name":"Euiwoong Lee","orcid":"https://orcid.org/0000-0003-1454-7587"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Euiwoong Lee","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081196371","display_name":"Chao Xu","orcid":"https://orcid.org/0000-0003-4417-3299"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chao Xu","raw_affiliation_strings":["University of Illinois, Urbana-Champaign, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5011591780"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.2145,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53457137,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"177","issue":"1-2","first_page":"291","last_page":"320"},"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.9969000220298767,"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.9933000206947327,"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/mathematics","display_name":"Mathematics","score":0.8136598467826843},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7117910385131836},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6764969825744629},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.51246577501297},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4699186384677887},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.46116703748703003},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4591078758239746},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.45599573850631714},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4534112215042114},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42157530784606934},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4207667112350464},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11018460988998413}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8136598467826843},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7117910385131836},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6764969825744629},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.51246577501297},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4699186384677887},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.46116703748703003},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4591078758239746},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.45599573850631714},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4534112215042114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42157530784606934},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4207667112350464},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11018460988998413},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10107-018-1270-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-018-1270-8","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:real.mtak.hu:113048","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400081","display_name":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210140733","host_organization_name":"Library and Information Centre of the Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I4210140733"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G401424543","display_name":null,"funder_award_id":"CCF-1526799","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1523006294","https://openalex.org/W1542177083","https://openalex.org/W1995027289","https://openalex.org/W2025526852","https://openalex.org/W2060121592","https://openalex.org/W2096411231","https://openalex.org/W2112407798","https://openalex.org/W2119378898","https://openalex.org/W2120358419","https://openalex.org/W2122466336","https://openalex.org/W2152986618","https://openalex.org/W2167236203","https://openalex.org/W2167637346","https://openalex.org/W2168919539","https://openalex.org/W2495847740","https://openalex.org/W2515547009","https://openalex.org/W2557153431","https://openalex.org/W2612669355","https://openalex.org/W2953295821","https://openalex.org/W3009415557","https://openalex.org/W3121576764"],"related_works":["https://openalex.org/W2043128958","https://openalex.org/W2147954430","https://openalex.org/W2178484001","https://openalex.org/W2075073335","https://openalex.org/W2565240018","https://openalex.org/W3196191381","https://openalex.org/W2622090745","https://openalex.org/W2276756934","https://openalex.org/W2370572809","https://openalex.org/W2031552172"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}