{"id":"https://openalex.org/W7119512248","doi":"https://doi.org/10.1002/net.70023","title":"Tractable but Hard to Approximate: The Bi\u2010Objective Minimum s\u2010t\u2010Cut Problem With Binary Capacities","display_name":"Tractable but Hard to Approximate: The Bi\u2010Objective Minimum s\u2010t\u2010Cut Problem With Binary Capacities","publication_year":2026,"publication_date":"2026-01-09","ids":{"openalex":"https://openalex.org/W7119512248","doi":"https://doi.org/10.1002/net.70023"},"language":"en","primary_location":{"id":"doi:10.1002/net.70023","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.70023","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5033166559","display_name":"Jan Boeckmann","orcid":"https://orcid.org/0000-0001-5909-8354"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Jan Boeckmann","raw_affiliation_strings":["Johannes Kepler University Linz Institute for Business Analytics and Technology Transformation  Linz Austria"],"affiliations":[{"raw_affiliation_string":"Johannes Kepler University Linz Institute for Business Analytics and Technology Transformation  Linz Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044116067","display_name":"Stephan Helfrich","orcid":"https://orcid.org/0000-0001-6588-5266"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stephan Helfrich","raw_affiliation_strings":["Karlsruhe Institute of Technology, Operations of Critical Infrastructures Institute of Information Security and Dependability (KASTEL)  Karlsruhe Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Operations of Critical Infrastructures Institute of Information Security and Dependability (KASTEL)  Karlsruhe Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064501511","display_name":"Oliver Bachtler","orcid":"https://orcid.org/0000-0001-7942-0750"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]},{"id":"https://openalex.org/I73114660","display_name":"University of Applied Sciences Kaiserslautern","ror":"https://ror.org/05dkqa017","country_code":"DE","type":"education","lineage":["https://openalex.org/I73114660"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Oliver Bachtler","raw_affiliation_strings":["RPTU Kaiserslautern\u2010Landau Department of Mathematics  Kaiserslautern Germany"],"affiliations":[{"raw_affiliation_string":"RPTU Kaiserslautern\u2010Landau Department of Mathematics  Kaiserslautern Germany","institution_ids":["https://openalex.org/I153267046","https://openalex.org/I73114660"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122317478","display_name":"Stefan Ruzika","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]},{"id":"https://openalex.org/I73114660","display_name":"University of Applied Sciences Kaiserslautern","ror":"https://ror.org/05dkqa017","country_code":"DE","type":"education","lineage":["https://openalex.org/I73114660"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Ruzika","raw_affiliation_strings":["RPTU Kaiserslautern\u2010Landau Department of Mathematics  Kaiserslautern Germany"],"affiliations":[{"raw_affiliation_string":"RPTU Kaiserslautern\u2010Landau Department of Mathematics  Kaiserslautern Germany","institution_ids":["https://openalex.org/I153267046","https://openalex.org/I73114660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050306276","display_name":"Clemens Thielen","orcid":"https://orcid.org/0000-0003-0897-3571"},"institutions":[{"id":"https://openalex.org/I4210141604","display_name":"Stadtwerke Straubing (Germany)","ror":"https://ror.org/04870rh38","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210141604"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Clemens Thielen","raw_affiliation_strings":["Technical University of Munich Campus Straubing for Biotechnology and Sustainability  Straubing Germany"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich Campus Straubing for Biotechnology and Sustainability  Straubing Germany","institution_ids":["https://openalex.org/I4210141604"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5033166559"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07586558,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"87","issue":"3","first_page":"312","last_page":"321"},"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.43140000104904175,"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.43140000104904175,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.1762000024318695,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.14839999377727509,"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/bounded-function","display_name":"Bounded function","score":0.664900004863739},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.6118999719619751},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.546500027179718},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4652000069618225},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4537999927997589},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.44769999384880066},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41670000553131104},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.3930000066757202},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.38109999895095825}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7508999705314636},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.664900004863739},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.6118999719619751},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.546500027179718},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47360000014305115},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4652000069618225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45730000734329224},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4537999927997589},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.44769999384880066},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41670000553131104},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.3930000066757202},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.38109999895095825},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.3758000135421753},{"id":"https://openalex.org/C22251595","wikidata":"https://www.wikidata.org/wiki/Q670036","display_name":"Arc length","level":3,"score":0.32269999384880066},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30250000953674316},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.29589998722076416},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.2728999853134155},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.26339998841285706},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.2583000063896179},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.70023","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.70023","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4271332095","display_name":null,"funder_award_id":"GRK 2982, 516090167","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W80157279","https://openalex.org/W1493541567","https://openalex.org/W1579049696","https://openalex.org/W1928381443","https://openalex.org/W1965106414","https://openalex.org/W2021180976","https://openalex.org/W2032950184","https://openalex.org/W2037479769","https://openalex.org/W2059372025","https://openalex.org/W2085041447","https://openalex.org/W2115049345","https://openalex.org/W2136658137","https://openalex.org/W2167637346","https://openalex.org/W2953286221","https://openalex.org/W2962853446","https://openalex.org/W3128852614","https://openalex.org/W3187054370"],"related_works":[],"abstract_inverted_index":{"ABSTRACT":[0],"The":[1],"minimum":[2,64,127,141,221],"\u2010\u2010cut":[3,65,128,142,222],"problem":[4,30,66,129,143,160,223],"is":[5,100,154],"one":[6],"of":[7,28,45,75,97,196,217,240],"the":[8,25,29,42,63,73,95,104,126,140,158,163,187,194,204,220],"most\u2010studied":[9],"problems":[10,166,188],"in":[11,20,34,41,81,103,136,150,167,183,203,233],"discrete":[12],"optimization":[13,169],"and":[14,47,82,89,133,147,186],"has":[15,38],"a":[16,55],"unique":[17],"complexity":[18],"status":[19],"multi\u2010objective":[21,56,168],"optimization.":[22],"Even":[23],"though":[24,177],"single\u2010objective":[26,179],"version":[27],"can":[31,229],"be":[32,230],"solved":[33,231],"polynomial":[35,184,200,234],"time,":[36],"it":[37],"been":[39],"shown":[40],"seminal":[43],"work":[44],"Papadimitriou":[46],"Yannakakis":[48],"(2000)":[49],"that":[50,170,192],"there":[51,119],"does":[52,120],"not":[53,121,172],"exist":[54,122],"fully":[57],"polynomial\u2010time":[58],"approximation":[59],"scheme":[60],"(MFPTAS)":[61],"for":[62,72,83,91,125,139,236],"unless":[67],".":[68,151],"This":[69,152],"holds":[70],"both":[71],"case":[74],"objective":[76,84],"functions":[77,85],"with":[78,86,130,144,224],"arc":[79,134,148,227],"capacities":[80,135,149,228],"general":[87],"capacities,":[88],"even":[90,176],"tractable":[92,190],"instances":[93],"where":[94],"number":[96,239],"non\u2010dominated":[98,197],"points":[99,198],"only":[101,164],"quadratic":[102],"input":[105,205],"size.":[106,206],"In":[107],"this":[108,210],"article,":[109],"we":[110,208],"strengthen":[111],"these":[112],"results":[113],"by":[114,212],"showing":[115,213],"that,":[116,214],"assuming":[117],",":[118,137,191],"an":[123,174],"MFPTAS":[124,175],"two":[131,145],"objectives":[132,146],"nor":[138],"advancement":[153],"particularly":[155],"interesting":[156],"since":[157],"considered":[159],"variants":[161],"are":[162,181,189,199],"known":[165],"do":[171],"admit":[173],"their":[178],"versions":[180],"solvable":[182],"time":[185,235],"is,":[193],"numbers":[195],"(even":[201],"linear)":[202],"Furthermore,":[207],"complement":[209],"result":[211],"on":[215],"graphs":[216],"bounded":[218,226],"tree\u2010width,":[219],"polynomially":[225],"exactly":[232],"any":[237],"constant":[238],"objectives.":[241]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-01-09T00:00:00"}