{"id":"https://openalex.org/W1594553832","doi":"https://doi.org/10.1109/tit.2015.2465864","title":"The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes","display_name":"The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes","publication_year":2015,"publication_date":"2015-08-13","ids":{"openalex":"https://openalex.org/W1594553832","doi":"https://doi.org/10.1109/tit.2015.2465864","mag":"1594553832"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2015.2465864","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2015.2465864","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5052424155","display_name":"G\u00e1bor Braun","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gabor Braun","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043574831","display_name":"Sebastian Pokutta","orcid":"https://orcid.org/0000-0001-7365-3000"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sebastian Pokutta","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052424155"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":1.0915,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78476406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"61","issue":"10","first_page":"5754","last_page":"5764"},"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.9991999864578247,"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.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9965999722480774,"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.9919999837875366,"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/polytope","display_name":"Polytope","score":0.7654635906219482},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7321035861968994},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7313706278800964},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6763796806335449},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6257389783859253},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5763314962387085},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5386666059494019},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5268726944923401},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5213536024093628},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5097863078117371},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5012035369873047},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4970894157886505},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4886069893836975},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45274266600608826},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4453299939632416},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19780802726745605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10696667432785034},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09292307496070862}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7654635906219482},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7321035861968994},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7313706278800964},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6763796806335449},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6257389783859253},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5763314962387085},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5386666059494019},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5268726944923401},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5213536024093628},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5097863078117371},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5012035369873047},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4970894157886505},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4886069893836975},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45274266600608826},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4453299939632416},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19780802726745605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10696667432785034},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09292307496070862},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2015.2465864","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2015.2465864","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W87237596","https://openalex.org/W777079203","https://openalex.org/W1602703888","https://openalex.org/W1816633297","https://openalex.org/W1832679686","https://openalex.org/W1965650902","https://openalex.org/W1967232806","https://openalex.org/W2010730726","https://openalex.org/W2019935404","https://openalex.org/W2031923588","https://openalex.org/W2033871299","https://openalex.org/W2039156581","https://openalex.org/W2061987651","https://openalex.org/W2065139435","https://openalex.org/W2066620631","https://openalex.org/W2070486524","https://openalex.org/W2078825942","https://openalex.org/W2081052967","https://openalex.org/W2081254453","https://openalex.org/W2091039687","https://openalex.org/W2095405086","https://openalex.org/W2107917944","https://openalex.org/W2111517082","https://openalex.org/W2119368733","https://openalex.org/W2122539238","https://openalex.org/W2141432745","https://openalex.org/W2159584454","https://openalex.org/W2327315803","https://openalex.org/W2400109196","https://openalex.org/W2401280342","https://openalex.org/W2477453038","https://openalex.org/W2478708596","https://openalex.org/W2489729120","https://openalex.org/W2534717833","https://openalex.org/W2568023417","https://openalex.org/W2949885909","https://openalex.org/W2952775235","https://openalex.org/W3022030295","https://openalex.org/W3105094916","https://openalex.org/W4298134865","https://openalex.org/W6603483988","https://openalex.org/W6622451739","https://openalex.org/W6635957047","https://openalex.org/W6636866650","https://openalex.org/W6638780195","https://openalex.org/W6641839233","https://openalex.org/W6658806244","https://openalex.org/W6670259055","https://openalex.org/W6673474800","https://openalex.org/W6678040657","https://openalex.org/W6713510015","https://openalex.org/W6786010551"],"related_works":["https://openalex.org/W2952452737","https://openalex.org/W4300637737","https://openalex.org/W2593080689","https://openalex.org/W1991979416","https://openalex.org/W2254726702","https://openalex.org/W2395976569","https://openalex.org/W276709744","https://openalex.org/W2089597459","https://openalex.org/W1966079129","https://openalex.org/W2117839333"],"abstract_inverted_index":{"Recently,":[0],"Rothvo\u00df":[1],"established":[2],"that":[3,213],"every":[4,49],"linear":[5],"program":[6],"(LP)":[7],"expressing":[8],"the":[9,19,35,39,63,71,86,96,126,139,148,155,169,178,195,204,207,214,219,224,231,234],"matching":[10,20,40,94,208,220],"polytope":[11,21],"has":[12,22],"an":[13,55,115,159],"exponential":[14,23,56],"number":[15,57,64],"of":[16,38,58,65,74,88,114,141,151,181,198,200,206,227,233],"inequalities":[17],"(formally,":[18],"extension":[24,216],"complexity).":[25],"We":[26,153],"generalize":[27],"this":[28],"result":[29],"by":[30,85],"deriving":[31],"strong":[32],"bounds":[33],"on":[34],"LP":[36,53,108,112,128,142,188],"inapproximability":[37],"problem:":[41],"for":[42,186,218],"fixed":[43],"0":[44],"<;":[45,47],"\u03b5":[46],"1,":[48],"(1":[50],"-":[51],"\u03b5/n)-approximating":[52],"requires":[54],"inequalities,":[59],"where":[60],"n":[61],"is":[62,68,95,144,174],"vertices.":[66],"This":[67,190],"sharp,":[69],"given":[70],"well-known":[72],"\u03c1-approximation":[73],"size":[75,89,140],"O(1/(":[76],"<sub":[77],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[78,81],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1-\u03c1</sub>":[79],"<sup":[80],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[82],"))":[83],"provided":[84],"odd-sets":[87,135],"up":[90],"to":[91,146,193],"1/(1-\u03c1).":[92],"Thus,":[93],"first":[97],"problem":[98,221],"in":[99,230],"F,":[100],"which":[101,120],"does":[102],"not":[103],"admit":[104],"a":[105,122,237],"fully":[106],"polynomial-size":[107,127],"relaxation":[109,129],"scheme":[110,130],"(the":[111],"equivalent":[113,145],"Fully":[116],"Polynomial-Time":[117],"Approximation":[118],"Scheme),":[119],"provides":[121],"sharp":[123],"separation":[124],"from":[125,167,223],"obtained,":[131],"e.g.,":[132,203],"through":[133,158],"constant-sized":[134],"mentioned":[136],"above.":[137],"Analyzing":[138],"formulations":[143],"examining":[147],"nonnegative":[149,156,196],"rank":[150,157,197],"matrices.":[152],"study":[154],"information-theoretic":[160,179],"approach;":[161],"while":[162],"it":[163],"reuses":[164],"key":[165],"ideas":[166],"Rothvo\u00df,":[168],"main":[170],"lower":[171],"bounding":[172],"technique":[173],"different:":[175],"we":[176],"employ":[177],"notion":[180],"Wyner's":[182],"common":[183],"information":[184],"used":[185],"studying":[187],"formulations.":[189],"allows":[191],"us":[192],"analyze":[194],"perturbations":[199],"slack":[201],"matrices,":[202],"approximations":[205],"polytope.":[209],"It":[210],"turns":[211],"out":[212],"high":[215],"complexity":[217],"stems":[222],"same":[225],"source":[226],"hardness":[228],"as":[229],"case":[232],"correlation":[235],"polytope:":[236],"direct":[238],"sum":[239],"structure.":[240]},"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":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}