{"id":"https://openalex.org/W2111940021","doi":"https://doi.org/10.1137/12087222x","title":"On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms","display_name":"On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2111940021","doi":"https://doi.org/10.1137/12087222x","mag":"2111940021"},"language":"en","primary_location":{"id":"doi:10.1137/12087222x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/12087222x","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/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Philip Klein","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5006234305","display_name":"Neal E. Young","orcid":"https://orcid.org/0000-0001-8144-3345"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neal E. Young","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035567880"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1031,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.87765256,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"44","issue":"4","first_page":"1154","last_page":"1172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994000196456909,"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"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7095142602920532},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6899282336235046},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6439467668533325},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6356311440467834},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6133326888084412},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4672560393810272},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45749199390411377},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.45586374402046204},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.45467597246170044},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.432399719953537},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37105584144592285},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.36483922600746155},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16959315538406372},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15117532014846802}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7095142602920532},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6899282336235046},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6439467668533325},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6356311440467834},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6133326888084412},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4672560393810272},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45749199390411377},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.45586374402046204},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.45467597246170044},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.432399719953537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37105584144592285},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.36483922600746155},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16959315538406372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15117532014846802},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/12087222x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/12087222x","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":21,"referenced_works":["https://openalex.org/W1576264907","https://openalex.org/W2009803313","https://openalex.org/W2010223239","https://openalex.org/W2014029180","https://openalex.org/W2035652501","https://openalex.org/W2050328660","https://openalex.org/W2053924317","https://openalex.org/W2058748455","https://openalex.org/W2069488552","https://openalex.org/W2073356062","https://openalex.org/W2089559088","https://openalex.org/W2105560970","https://openalex.org/W2106887613","https://openalex.org/W2122205547","https://openalex.org/W2132423524","https://openalex.org/W2134422938","https://openalex.org/W2150865801","https://openalex.org/W2167732364","https://openalex.org/W2169287093","https://openalex.org/W4231610975","https://openalex.org/W4242767541"],"related_works":["https://openalex.org/W2123656547","https://openalex.org/W3144955698","https://openalex.org/W2142695913","https://openalex.org/W2055782437","https://openalex.org/W2107689258","https://openalex.org/W2593080689","https://openalex.org/W2039006033","https://openalex.org/W1991979416","https://openalex.org/W4205854323","https://openalex.org/W2115855742"],"abstract_inverted_index":{"We":[0,22],"give":[1],"a":[2,10,47,63,110],"lower":[3,117],"bound":[4,59,118],"on":[5,32,119],"the":[6,53,56,66,72,106,120],"iteration":[7],"complexity":[8],"of":[9,13,55,65,123],"natural":[11],"class":[12,73],"Lagrangian-relaxation":[14],"algorithms":[15,70],"for":[16,62,87,127],"approximately":[17],"solving":[18],"packing/covering":[19],"linear":[20],"programs.":[21],"show":[23,114],"that,":[24],"given":[25],"an":[26,115],"input":[27],"with":[28,35],"$m$":[29],"random":[30,128],"0/1-constraints":[31],"$n$":[33],"variables,":[34],"high":[36],"probability,":[37],"any":[38],"such":[39],"algorithm":[40],"requires":[41],"$\\Omega(\\rho":[42],"\\log(m)/\\epsilon^2)$":[43],"iterations":[44],"to":[45,113],"compute":[46],"$(1+\\epsilon)$-approximate":[48,124],"solution,":[49],"where":[50],"$\\rho$":[51],"is":[52,60],"width":[54],"input.":[57],"The":[58,69],"tight":[61],"range":[64],"parameters":[67],"$(m,n,\\rho,\\epsilon)$.":[68],"in":[71],"include":[74],"Dantzig--Wolfe":[75],"decomposition,":[76,78],"Benders'":[77],"Lagrangian":[79],"relaxation":[80],"as":[81],"developed":[82],"by":[83,95],"Held":[84],"and":[85,90,98,100,102],"Karp":[86],"lower-bounding":[88],"TSP,":[89],"many":[91],"others":[92],"(e.g.,":[93],"those":[94],"Plotkin,":[96],"Shmoys,":[97],"Tardos":[99],"Grigoriadis":[101],"Khachiyan).":[103],"To":[104],"prove":[105],"bound,":[107],"we":[108],"use":[109],"discrepancy":[111],"argument":[112],"analogous":[116],"support":[121],"size":[122],"mixed":[125],"strategies":[126],"two-player":[129],"zero-sum":[130],"0/1-matrix":[131],"games.":[132]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}