{"id":"https://openalex.org/W2996397717","doi":"https://doi.org/10.1145/3280847","title":"The Simplex Algorithm Is NP-Mighty","display_name":"The Simplex Algorithm Is NP-Mighty","publication_year":2018,"publication_date":"2018-11-16","ids":{"openalex":"https://openalex.org/W2996397717","doi":"https://doi.org/10.1145/3280847","mag":"2996397717"},"language":"en","primary_location":{"id":"doi:10.1145/3280847","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3280847","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5021248592","display_name":"Yann Disser","orcid":"https://orcid.org/0000-0002-2085-0454"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Yann Disser","raw_affiliation_strings":["TU Darmstadt, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055693054","display_name":"Martin Skutella","orcid":"https://orcid.org/0000-0002-9814-1703"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Skutella","raw_affiliation_strings":["TU Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021248592"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":1.0097,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.80028644,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"1","first_page":"1","last_page":"19"},"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.9984999895095825,"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.9984999895095825,"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.9983999729156494,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/simplex-algorithm","display_name":"Simplex algorithm","score":0.8104099035263062},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6573455333709717},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.6470072865486145},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5839785933494568},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5270272493362427},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5085846185684204},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5070183277130127},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.47742947936058044},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42710500955581665},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3705351948738098},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3647947907447815},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36227643489837646},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20930299162864685}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.8104099035263062},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6573455333709717},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6470072865486145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5839785933494568},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5270272493362427},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5085846185684204},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5070183277130127},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.47742947936058044},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42710500955581665},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3705351948738098},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3647947907447815},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36227643489837646},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20930299162864685},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3280847","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3280847","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:133261","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/133261/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Artikel"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W201713329","https://openalex.org/W629161119","https://openalex.org/W1537272759","https://openalex.org/W1571051474","https://openalex.org/W1964119857","https://openalex.org/W2011039300","https://openalex.org/W2033040247","https://openalex.org/W2034053794","https://openalex.org/W2040194491","https://openalex.org/W2047907098","https://openalex.org/W2061874298","https://openalex.org/W2067768752","https://openalex.org/W2079436493","https://openalex.org/W2089649903","https://openalex.org/W2092572272","https://openalex.org/W2103981148","https://openalex.org/W2126469728","https://openalex.org/W2127470768","https://openalex.org/W2150154671","https://openalex.org/W2156849732","https://openalex.org/W2169359757","https://openalex.org/W2234958105","https://openalex.org/W2249369553","https://openalex.org/W2539040520","https://openalex.org/W2611147814","https://openalex.org/W2951283899","https://openalex.org/W2962713740","https://openalex.org/W3139172074","https://openalex.org/W4244424643","https://openalex.org/W4300462944"],"related_works":["https://openalex.org/W2133667137","https://openalex.org/W2380756614","https://openalex.org/W2384679317","https://openalex.org/W2477407501","https://openalex.org/W1570109187","https://openalex.org/W2366013513","https://openalex.org/W3125083766","https://openalex.org/W4244786412","https://openalex.org/W2028887049","https://openalex.org/W3143155029"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,124],"the":[3,6,15,43,80,90,93,98,115],"Simplex":[4,8,81],"Method,":[5],"Network":[7],"Method\u2014both":[9],"with":[10,34],"Dantzig\u2019s":[11],"original":[12],"pivot":[13],"rule\u2014and":[14],"Successive":[16],"Shortest":[17],"Path":[18],"Algorithm":[19],"are":[20,103,128],"NP-mighty":[21],".":[22],"That":[23],"is,":[24],"each":[25],"of":[26,64,100,117],"these":[27,54],"algorithms":[28],"can":[29],"be":[30],"used":[31],"to":[32,79,130],"solve,":[33],"polynomial":[35],"overhead,":[36],"any":[37],"problem":[38,113],"in":[39,114],"NP":[40],"implicitly":[41],"during":[42,92],"algorithm\u2019s":[44,94],"execution.":[45],"This":[46],"result":[47],"casts":[48],"a":[49,62,76,85,110],"more":[50],"favorable":[51],"light":[52],"on":[53],"algorithms\u2019":[55],"exponential":[56],"worst-case":[57],"running":[58],"times.":[59],"Furthermore,":[60],"as":[61],"consequence":[63],"our":[65],"approach,":[66],"we":[67,108],"obtain":[68],"several":[69],"novel":[70],"hardness":[71],"results.":[72],"For":[73],"example,":[74],"for":[75],"given":[77,86],"input":[78],"Algorithm,":[82],"deciding":[83],"whether":[84],"variable":[87],"ever":[88],"enters":[89],"basis":[91],"execution":[95],"and":[96],"determining":[97],"number":[99],"iterations":[101],"needed":[102],"both":[104],"NP-hard":[105,129],"problems.":[106],"Finally,":[107],"close":[109],"long-standing":[111],"open":[112],"area":[116],"network":[118],"flows":[119,127],"over":[120],"time":[121],"by":[122],"showing":[123],"earliest":[125],"arrival":[126],"obtain.":[131]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4}],"updated_date":"2026-02-26T08:16:20.718346","created_date":"2025-10-10T00:00:00"}