{"id":"https://openalex.org/W2078908612","doi":"https://doi.org/10.1137/0213003","title":"Linear Time Algorithms for Two- and Three-Variable Linear Programs","display_name":"Linear Time Algorithms for Two- and Three-Variable Linear Programs","publication_year":1984,"publication_date":"1984-02-01","ids":{"openalex":"https://openalex.org/W2078908612","doi":"https://doi.org/10.1137/0213003","mag":"2078908612"},"language":"en","primary_location":{"id":"doi:10.1137/0213003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213003","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5019297501","display_name":"Martin Dyer","orcid":"https://orcid.org/0000-0002-2018-0374"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. E. Dyer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019297501"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.1724,"has_fulltext":false,"cited_by_count":197,"citation_normalized_percentile":{"value":0.96716931,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"1","first_page":"31","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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/linear-programming","display_name":"Linear programming","score":0.7311322689056396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6063090562820435},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5907987952232361},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.5614562034606934},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.556631863117218},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5218521356582642},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4849453270435333},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.4734515845775604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36717480421066284}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7311322689056396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6063090562820435},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5907987952232361},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.5614562034606934},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.556631863117218},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5218521356582642},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4849453270435333},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.4734515845775604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36717480421066284},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0213003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213003","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1987647724","https://openalex.org/W1991287453","https://openalex.org/W1996641400","https://openalex.org/W2020085260","https://openalex.org/W2041775009","https://openalex.org/W2081280922","https://openalex.org/W2090286414","https://openalex.org/W2094855951","https://openalex.org/W4249667877"],"related_works":["https://openalex.org/W4205348974","https://openalex.org/W2784100870","https://openalex.org/W4214624958","https://openalex.org/W2007464938","https://openalex.org/W2337360258","https://openalex.org/W2133667137","https://openalex.org/W2293098548","https://openalex.org/W3182682721","https://openalex.org/W4386394964","https://openalex.org/W2107423006"],"abstract_inverted_index":{"$O(n)$":[0],"time":[1,41],"algorithms":[2,31],"for":[3,42],"linear":[4,23],"programming":[5],"problems":[6],"with":[7],"two":[8],"or":[9],"three":[10],"variables":[11],"and":[12,25],"n":[13],"constraints":[14],"are":[15],"described.":[16],"The":[17,30],"approach":[18],"uses":[19],"convexity,":[20],"dominance":[21],"of":[22,38,44],"functions":[24],"linear-time":[26],"median":[27],"finding":[28],"algorithms.":[29],"improve":[32],"the":[33],"previously":[34],"known":[35],"best":[36],"bounds":[37],"$O(n\\log":[39],"n)$":[40],"both":[43],"these":[45],"problems.":[46]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}