{"id":"https://openalex.org/W2128548465","doi":"https://doi.org/10.37236/1924","title":"Faster Algorithms for Frobenius Numbers","display_name":"Faster Algorithms for Frobenius Numbers","publication_year":2005,"publication_date":"2005-06-14","ids":{"openalex":"https://openalex.org/W2128548465","doi":"https://doi.org/10.37236/1924","mag":"2128548465"},"language":"en","primary_location":{"id":"doi:10.37236/1924","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1924","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r27/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r27/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021728034","display_name":"Dale Beihoffer","orcid":null},"institutions":[{"id":"https://openalex.org/I2800692847","display_name":"Lake County","ror":"https://ror.org/04npefg86","country_code":"US","type":"government","lineage":["https://openalex.org/I2800692847"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dale Beihoffer","raw_affiliation_strings":["Lakeville, Minnesota, USA"],"affiliations":[{"raw_affiliation_string":"Lakeville, Minnesota, USA","institution_ids":["https://openalex.org/I2800692847"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071004588","display_name":"Jemimah Hendry","orcid":null},"institutions":[{"id":"https://openalex.org/I4210117215","display_name":"Cosmetics Europe","ror":"https://ror.org/02errzw26","country_code":"BE","type":"other","lineage":["https://openalex.org/I4210117215"]},{"id":"https://openalex.org/I4210090273","display_name":"Madison Group (United States)","ror":"https://ror.org/00aw4mh72","country_code":"US","type":"company","lineage":["https://openalex.org/I4210090273"]}],"countries":["BE","US"],"is_corresponding":false,"raw_author_name":"Jemimah Hendry","raw_affiliation_strings":["Madison, Wisconsin, USA","MAC Cosmetics"],"affiliations":[{"raw_affiliation_string":"Madison, Wisconsin, USA","institution_ids":["https://openalex.org/I4210090273"]},{"raw_affiliation_string":"MAC Cosmetics","institution_ids":["https://openalex.org/I4210117215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020179246","display_name":"Albert Nijenhuis","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]},{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Albert Nijenhuis","raw_affiliation_strings":["Seattle, Washington, USA","University of Washington"],"affiliations":[{"raw_affiliation_string":"Seattle, Washington, USA","institution_ids":["https://openalex.org/I58610484"]},{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071727828","display_name":"Stan Wagon","orcid":"https://orcid.org/0000-0002-4524-0767"},"institutions":[{"id":"https://openalex.org/I5444425","display_name":"Macalester College","ror":"https://ror.org/04fceqm38","country_code":"US","type":"education","lineage":["https://openalex.org/I5444425"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stan Wagon","raw_affiliation_strings":["Macalester College, St. Paul, Minnesota, USA","Macalester College"],"affiliations":[{"raw_affiliation_string":"Macalester College, St. Paul, Minnesota, USA","institution_ids":["https://openalex.org/I5444425"]},{"raw_affiliation_string":"Macalester College","institution_ids":["https://openalex.org/I5444425"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5021728034"],"corresponding_institution_ids":["https://openalex.org/I2800692847"],"apc_list":null,"apc_paid":null,"fwci":3.5565,"has_fulltext":true,"cited_by_count":73,"citation_normalized_percentile":{"value":0.93697327,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"12","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9970999956130981,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9970999956130981,"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/T10374","display_name":"Advanced Graph Theory Research","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/T11269","display_name":"Algorithms and Data Compression","score":0.9962999820709229,"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/mathematics","display_name":"Mathematics","score":0.7140241861343384},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6769876480102539},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.595262348651886},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5709505081176758},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5667176842689514},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5281396508216858},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44114676117897034},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4310099184513092},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42572298645973206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.415442556142807},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41439470648765564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14319050312042236}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7140241861343384},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6769876480102539},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.595262348651886},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5709505081176758},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5667176842689514},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5281396508216858},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44114676117897034},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4310099184513092},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42572298645973206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.415442556142807},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41439470648765564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14319050312042236},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/1924","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1924","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r27/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.364.4903","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.4903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://stanwagon.com/public/FrobeniusElecJCombPaper.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.5670","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.5670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.emis.de/journals/EJC/Volume_12/PDF/v12i1r27.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1924","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1924","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r27/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2128548465.pdf","grobid_xml":"https://content.openalex.org/works/W2128548465.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W229079384","https://openalex.org/W254482520","https://openalex.org/W350260367","https://openalex.org/W1506489923","https://openalex.org/W1584582572","https://openalex.org/W1967509227","https://openalex.org/W1969549783","https://openalex.org/W1969711420","https://openalex.org/W1971718614","https://openalex.org/W1984486938","https://openalex.org/W2003926749","https://openalex.org/W2010601538","https://openalex.org/W2010667907","https://openalex.org/W2034662308","https://openalex.org/W2037812042","https://openalex.org/W2041287667","https://openalex.org/W2061430924","https://openalex.org/W2062513475","https://openalex.org/W2083869960","https://openalex.org/W2092017668","https://openalex.org/W2095095818","https://openalex.org/W2105277260","https://openalex.org/W2116603945","https://openalex.org/W2154258808","https://openalex.org/W2162635867","https://openalex.org/W2166739719","https://openalex.org/W2314115150","https://openalex.org/W2315016314","https://openalex.org/W2320330683","https://openalex.org/W2332901121","https://openalex.org/W2335606727","https://openalex.org/W2486137719","https://openalex.org/W2752885492","https://openalex.org/W2951098997","https://openalex.org/W3145128584","https://openalex.org/W4231475262","https://openalex.org/W4234728335"],"related_works":["https://openalex.org/W3183360588","https://openalex.org/W2951255695","https://openalex.org/W4298041365","https://openalex.org/W2518000780","https://openalex.org/W2995392498","https://openalex.org/W2065218154","https://openalex.org/W2007868364","https://openalex.org/W3209756645","https://openalex.org/W2375500696","https://openalex.org/W1547721959"],"abstract_inverted_index":{"The":[0,177],"Frobenius":[1,44],"problem,":[2,12],"also":[3,197,254],"known":[4],"as":[5,205],"the":[6,10,43,52,74,97,102,147,155,160,169,211,233,263],"postage-stamp":[7],"problem":[8,17,75,79,156],"or":[9,220],"money-changing":[11],"is":[13,51,71,172,181,246,268],"an":[14],"integer":[15,21],"programming":[16],"that":[18,56,109,145,168,245,262],"seeks":[19],"nonnegative":[20],"solutions":[22],"to":[23,60,67,72,76,106,157,183,200,210,238],"$":[24,33,35,128,274],"x_1":[25],"a_1":[26,129,174,192],"+\\cdots":[27],"+":[28],"x_n":[29],"a_n":[30],"=M$,":[31],"where":[32,47,125],"a_i":[34,49],"and":[36,127,143,150,185,187],"$M$":[37,54],"are":[38,110],"positive":[39],"integers.":[40],"In":[41],"particular,":[42],"number":[45,70,148],"$f(A)$,":[46],"$A=\\{":[48],"\\}$,":[50],"largest":[53],"so":[55],"this":[57,69],"equation":[58,213],"fails":[59],"have":[61,133],"a":[62,77,81,116,208,215,227,239,256,269],"solution.":[63],"A":[64],"simple":[65],"way":[66],"compute":[68],"transform":[73],"shortest-path":[78],"in":[80,104,154,189],"directed":[82],"weighted":[83],"graph;":[84],"then":[85,230],"Dijkstra's":[86],"algorithm":[87],"can":[88,95,122,196],"be":[89,198],"used.":[90],"We":[91,132,229,253],"show":[92,231],"how":[93,232],"one":[94,138],"use":[96],"additional":[98],"symmetry":[99],"properties":[100],"of":[101,218,266,273],"graph":[103,234],"question":[105],"design":[107],"algorithms":[108,195],"very":[111],"fast.":[112],"For":[113,163],"example,":[114],"on":[115,140,243],"standard":[117],"desktop":[118],"computer,":[119],"our":[120],"methods":[121,165],"handle":[123],"cases":[124],"$n=10$":[126],"=":[130],"10^7$.":[131],"two":[134],"main":[135,212],"new":[136,240],"methods,":[137],"based":[139],"breadth-first":[141],"search":[142],"another":[144],"uses":[146],"theory":[149,235],"combinatorial":[151],"structure":[152],"inherent":[153],"speed":[158],"up":[159],"Dijkstra":[161],"approach.":[162],"both":[164],"we":[166],"conjecture":[167],"average-case":[170],"complexity":[171],"$O(":[173,191],"\\sqrt{n}":[175],")$.":[176],"previous":[178],"best":[179],"method":[180],"due":[182],"B\u00f6cker":[184],"Lipt\u00e1k":[186],"runs":[188],"time":[190],"n)$.":[193],"These":[194],"used":[199],"solve":[201],"auxiliary":[202],"problems":[203],"such":[204],"(1)":[206],"find":[207],"solution":[209],"for":[214],"given":[216],"value":[217,265],"$M$;":[219],"(2)":[221],"eliminate":[222],"all":[223],"redundant":[224],"entries":[225],"from":[226],"basis.":[228],"model":[236],"leads":[237],"upper":[241,251],"bound":[242],"$f(A)$":[244,267],"significantly":[247],"lower":[248],"than":[249],"existing":[250],"bounds.":[252],"present":[255],"conjecture,":[257],"supported":[258],"by":[259],"many":[260],"computations,":[261],"expected":[264],"small":[270],"constant":[271],"multiple":[272],"\\left({1\\over2}":[275],"\\,":[276,278],"n!":[277],"\\Pi":[279],"A\\right)^{1/(n-1)}":[280],"-\\Sigma":[281],"A$.":[282]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}