{"id":"https://openalex.org/W2011240422","doi":"https://doi.org/10.1137/0218019","title":"Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization","display_name":"Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization","publication_year":1989,"publication_date":"1989-04-01","ids":{"openalex":"https://openalex.org/W2011240422","doi":"https://doi.org/10.1137/0218019","mag":"2011240422"},"language":"en","primary_location":{"id":"doi:10.1137/0218019","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218019","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/A5086090227","display_name":"John Steele","orcid":"https://orcid.org/0000-0001-5507-5796"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Michael Steele","raw_affiliation_strings":["Princeton Univ., Princeton , NJ"],"affiliations":[{"raw_affiliation_string":"Princeton Univ., Princeton , NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003269193","display_name":"Timothy Law Snyder","orcid":null},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Timothy Law Snyder","raw_affiliation_strings":["Georgetown University , Washington, DC"],"affiliations":[{"raw_affiliation_string":"Georgetown University , Washington, DC","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086090227"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":3.3489,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.9295474,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"18","issue":"2","first_page":"278","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9955000281333923,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9955000281333923,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9904000163078308,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7615876793861389},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7511510848999023},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.661742091178894},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6520557999610901},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5787699818611145},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5604615211486816},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5096845626831055},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5069975852966309},{"id":"https://openalex.org/keywords/unit-cube","display_name":"Unit cube","score":0.48669248819351196},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4606928527355194},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.443178653717041},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4420340359210968},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33380070328712463},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27983155846595764},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10288190841674805},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10247692465782166}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7615876793861389},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7511510848999023},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.661742091178894},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6520557999610901},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5787699818611145},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5604615211486816},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5096845626831055},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5069975852966309},{"id":"https://openalex.org/C60432849","wikidata":"https://www.wikidata.org/wiki/Q2072112","display_name":"Unit cube","level":2,"score":0.48669248819351196},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4606928527355194},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.443178653717041},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4420340359210968},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33380070328712463},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27983155846595764},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10288190841674805},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10247692465782166},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0218019","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218019","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"},{"id":"pmh:oai:repository.upenn.edu:oid_papers-1048","is_oa":false,"landing_page_url":"https://repository.upenn.edu/oid_papers/259","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Operations, Information and Decisions Papers","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1975224834","https://openalex.org/W2009803313","https://openalex.org/W2014068360","https://openalex.org/W2023830447","https://openalex.org/W2031658281","https://openalex.org/W2033010474","https://openalex.org/W2053913299","https://openalex.org/W2058748455","https://openalex.org/W2059988211","https://openalex.org/W2133226747","https://openalex.org/W2151977393","https://openalex.org/W2567873953","https://openalex.org/W4294358747"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W2390742649","https://openalex.org/W3101281637","https://openalex.org/W3099328339"],"abstract_inverted_index":{"A":[0],"method":[1],"is":[2,65],"presented":[3],"for":[4,85],"determining":[5],"the":[6,13,16,21,33,42,49,71,74,82,86,93,96],"asymptotic":[7,51],"worst-case":[8,43],"behavior":[9],"of":[10,15,23,29,38,54,102],"quantities":[11,88],"like":[12],"length":[14,22],"minimal":[17],"spanning":[18],"tree":[19],"or":[20],"an":[24],"optimal":[25],"traveling":[26],"salesman":[27],"tour":[28],"n":[30],"points":[31],"in":[32],"unit":[34],"d-cube.":[35],"In":[36],"each":[37],"these":[39],"classical":[40],"problems,":[41],"lengths":[44],"are":[45,100],"proved":[46],"to":[47],"have":[48],"exact":[50],"growth":[52,83],"rate":[53],"$\\beta":[55,63],"_n^{{{(d":[56],"-":[57],"1)}":[58],"/":[59],"d}}":[60],"$,":[61],"where":[62],"$":[64],"a":[66],"positive":[67],"constant":[68],"depending":[69],"on":[70,81,92],"problem":[72],"and":[73],"dimension.":[75],"These":[76],"results":[77,80,97],"complement":[78],"known":[79],"rates":[84],"analogous":[87],"under":[89],"probabilistic":[90,104],"assumptions":[91],"points,":[94],"but":[95],"given":[98],"here":[99],"free":[101],"any":[103],"hypotheses.":[105]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}