{"id":"https://openalex.org/W2122195804","doi":"https://doi.org/10.1145/2213977.2214081","title":"Matroids and integrality gaps for hypergraphic steiner tree relaxations","display_name":"Matroids and integrality gaps for hypergraphic steiner tree relaxations","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2122195804","doi":"https://doi.org/10.1145/2213977.2214081","mag":"2122195804"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214081","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.vu.nl/en/publications/87a149ea-4b9f-4c28-a1bc-ece9e529b0c7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112864313","display_name":"Michel X. Goemans","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michel X. Goemans","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071590414","display_name":"Neil Olver","orcid":"https://orcid.org/0000-0001-8897-5459"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neil Olver","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008952420","display_name":"Thomas Rothvo\u00df","orcid":"https://orcid.org/0009-0007-8314-0963"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Rothvo\u00df","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033406324","display_name":"Rico Zenklusen","orcid":"https://orcid.org/0000-0002-7148-9304"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rico Zenklusen","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5112864313"],"corresponding_institution_ids":["https://openalex.org/I4210110987","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":3.8015,"has_fulltext":true,"cited_by_count":60,"citation_normalized_percentile":{"value":0.93642872,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1161","last_page":"1176"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10142","display_name":"Formal Methods in Verification","score":0.9821000099182129,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8982613682746887},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.8955739736557007},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7661253809928894},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7353240251541138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6538276672363281},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.611501157283783},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6073727607727051},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6007973551750183},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5896732211112976},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5800198912620544},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5746747255325317},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5691617131233215},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5118902921676636},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.470415860414505},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.42878130078315735},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.31642788648605347},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3025311231613159},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19989153742790222},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.17921960353851318},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1260579228401184}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8982613682746887},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8955739736557007},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7661253809928894},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7353240251541138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6538276672363281},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.611501157283783},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6073727607727051},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6007973551750183},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5896732211112976},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5800198912620544},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5746747255325317},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5691617131233215},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5118902921676636},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.470415860414505},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.42878130078315735},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.31642788648605347},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3025311231613159},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19989153742790222},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.17921960353851318},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1260579228401184},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/2213977.2214081","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:research.vu.nl:openaire/87a149ea-4b9f-4c28-a1bc-ece9e529b0c7","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/87a149ea-4b9f-4c28-a1bc-ece9e529b0c7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Goemans, M, Olver, N K, Rothvoss, T & Zenklusen, R 2012, Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations. in Proceedings of the 44th ACM Symposium on Theory of Computing (STOC). ACM, pp. 1161-1176. https://doi.org/10.1145/2213977.2214081","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:researchonline.lse.ac.uk:103093","is_oa":false,"landing_page_url":"https://orcid.org/0000-0001-8897-5459>,","pdf_url":null,"source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:arXiv.org:1111.7280","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1111.7280","pdf_url":"https://arxiv.org/pdf/1111.7280","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:cwi.nl:26962","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/26962","pdf_url":"https://ir.cwi.nl/pub/26962/p1161-goemans.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:research.vu.nl:publications/87a149ea-4b9f-4c28-a1bc-ece9e529b0c7","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/87a149ea-4b9f-4c28-a1bc-ece9e529b0c7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Goemans, M, Olver, N K, Rothvoss, T & Zenklusen, R 2012, Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations. in Proceedings of the 44th ACM Symposium on Theory of Computing (STOC). ACM, pp. 1161-1176. https://doi.org/10.1145/2213977.2214081","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:research.vu.nl:openaire/87a149ea-4b9f-4c28-a1bc-ece9e529b0c7","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/87a149ea-4b9f-4c28-a1bc-ece9e529b0c7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Goemans, M, Olver, N K, Rothvoss, T & Zenklusen, R 2012, Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations. in Proceedings of the 44th ACM Symposium on Theory of Computing (STOC). ACM, pp. 1161-1176. https://doi.org/10.1145/2213977.2214081","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1378150017","display_name":null,"funder_award_id":"CCF-1115849","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5643251411","display_name":null,"funder_award_id":"and N00","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G6398359638","display_name":null,"funder_award_id":"N00014-11-1-0053","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8281068745","display_name":null,"funder_award_id":"1115849","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G955871416","display_name":"Polyhedral Techniques for the Design of Approximation Algorithms","funder_award_id":"0829878","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308269","display_name":"Alexander von Humboldt-Stiftung","ror":"https://ror.org/012kf4317"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W41039768","https://openalex.org/W109985799","https://openalex.org/W1504328953","https://openalex.org/W1598916021","https://openalex.org/W1774950136","https://openalex.org/W1928219016","https://openalex.org/W1965229006","https://openalex.org/W1968424093","https://openalex.org/W1976584101","https://openalex.org/W1979269423","https://openalex.org/W1991055327","https://openalex.org/W1998126097","https://openalex.org/W2012130001","https://openalex.org/W2027515293","https://openalex.org/W2039298646","https://openalex.org/W2042788891","https://openalex.org/W2055505431","https://openalex.org/W2056824842","https://openalex.org/W2070664846","https://openalex.org/W2086709935","https://openalex.org/W2097004206","https://openalex.org/W2119918317","https://openalex.org/W2121370879","https://openalex.org/W2340149117","https://openalex.org/W2988480584","https://openalex.org/W6601656252"],"related_works":["https://openalex.org/W974563791","https://openalex.org/W2739242419","https://openalex.org/W1595291551","https://openalex.org/W2980261836","https://openalex.org/W4244816249","https://openalex.org/W2183636263","https://openalex.org/W2999680961","https://openalex.org/W1992362850","https://openalex.org/W2050428285","https://openalex.org/W2096702260"],"abstract_inverted_index":{"Until":[0],"recently,":[1],"LP":[2,55,73,84,93,152],"relaxations":[3,94],"have":[4,33],"only":[5],"played":[6],"a":[7,53,59,88,122,144,157],"very":[8],"limited":[9],"role":[10],"in":[11],"the":[12,18,79,83,96,107,133,136,151,163],"design":[13],"of":[14,50,52,109,124,127,135,138,166],"approximation":[15,62,147],"algorithms":[16],"for":[17,95],"Steiner":[19,27,97],"tree":[20,28,98],"problem.":[21],"In":[22],"particular,":[23],"no":[24],"(efficiently":[25],"solvable)":[26],"relaxation":[29,56],"was":[30],"known":[31],"to":[32,115],"an":[34,47],"integrality":[35,117,164],"gap":[36,165],"bounded":[37],"away":[38],"from":[39,106],"2,":[40],"before":[41],"Byrka":[42,139],"et":[43,140],"al.":[44],"[3]":[45],"showed":[46],"upper":[48,160],"bound":[49,161],"~1.55":[51],"hypergraphic":[54,92,167],"and":[57,104,111,121,154],"presented":[58],"ln(4)+\u03b5":[60,146],"~1.39":[61],"based":[63],"on":[64,162],"this":[65],"relaxation.":[66],"Interestingly,":[67],"even":[68],"though":[69],"their":[70],"approach":[71],"is":[72],"based,":[74],"they":[75],"do":[76],"not":[77],"compare":[78],"solution":[80],"produced":[81],"against":[82,150],"value.":[85],"We":[86],"take":[87],"fresh":[89],"look":[90],"at":[91],"problem---one":[99],"that":[100,148],"heavily":[101],"exploits":[102],"methods":[103],"results":[105],"theory":[108],"matroids":[110],"submodular":[112],"functions---which":[113],"leads":[114],"stronger":[116],"gaps,":[118],"faster":[119],"algorithms,":[120],"variety":[123],"structural":[125],"insights":[126],"independent":[128],"interest.":[129],"More":[130],"precisely,":[131],"along":[132],"lines":[134],"algorithm":[137],"al.[3],":[141],"we":[142],"present":[143],"deterministic":[145],"compares":[149],"value":[153],"therefore":[155],"proves":[156],"matching":[158],"ln(4)":[159],"relaxations.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}