{"id":"https://openalex.org/W2986071419","doi":"https://doi.org/10.1145/3355400","title":"Algorithms to Approximate Column-sparse Packing Problems","display_name":"Algorithms to Approximate Column-sparse Packing Problems","publication_year":2019,"publication_date":"2019-11-15","ids":{"openalex":"https://openalex.org/W2986071419","doi":"https://doi.org/10.1145/3355400","mag":"2986071419"},"language":"en","primary_location":{"id":"doi:10.1145/3355400","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3355400","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3355400","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3355400","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050667686","display_name":"Brian Brubach","orcid":"https://orcid.org/0000-0003-1520-2812"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian Brubach","raw_affiliation_strings":["University of Maryland, College Park, Maryland, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056358363","display_name":"Karthik Abinav Sankararaman","orcid":"https://orcid.org/0000-0002-8569-5694"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karthik A. Sankararaman","raw_affiliation_strings":["University of Maryland, College Park, Maryland, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["University of Maryland, College Park, Maryland, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007399946","display_name":"Pan Xu","orcid":"https://orcid.org/0000-0002-6362-6727"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pan Xu","raw_affiliation_strings":["University of Maryland, College Park and New Jersey Institute of Technology, New Jersey, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park and New Jersey Institute of Technology, New Jersey, USA","institution_ids":["https://openalex.org/I118118575","https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5341,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70088085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"16","issue":"1","first_page":"1","last_page":"32"},"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.9997000098228455,"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.9997000098228455,"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.9986000061035156,"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/T12176","display_name":"Optimization and Packing Problems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.7182388305664062},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.7178642749786377},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.6770952343940735},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6060217618942261},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5930036306381226},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.5677594542503357},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5610015392303467},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5548268556594849},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.541566789150238},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5223965644836426},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.520954966545105},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.46256718039512634},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4128623306751251},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40113967657089233},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3683786392211914},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3662731647491455},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31792551279067993}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7182388305664062},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.7178642749786377},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.6770952343940735},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6060217618942261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5930036306381226},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.5677594542503357},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5610015392303467},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5548268556594849},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.541566789150238},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5223965644836426},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.520954966545105},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.46256718039512634},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4128623306751251},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40113967657089233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3683786392211914},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3662731647491455},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31792551279067993},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3355400","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3355400","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3355400","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3355400","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3355400","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3355400","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1585283696","display_name":"EAGER: Probabilistic Models and Algorithms","funder_award_id":"1749864","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1749484715","display_name":"AF: Small: Randomized Algorithms and Stochastic Models","funder_award_id":"1422569","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8911331200","display_name":"NetSE: Large: Collaborative Research: Contagion in Large Socio-Communication Networks","funder_award_id":"1010789","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/F4320307786","display_name":"Adobe Systems","ror":"https://ror.org/059tvcg64"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320310598","display_name":"Amazon Web Services","ror":"https://ror.org/04mv4n011"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2986071419.pdf","grobid_xml":"https://content.openalex.org/works/W2986071419.grobid-xml"},"referenced_works_count":64,"referenced_works":["https://openalex.org/W37721340","https://openalex.org/W782508147","https://openalex.org/W1482106463","https://openalex.org/W1526762477","https://openalex.org/W1577719727","https://openalex.org/W1965765215","https://openalex.org/W1966923282","https://openalex.org/W1974115975","https://openalex.org/W1976103322","https://openalex.org/W1989453388","https://openalex.org/W1993119087","https://openalex.org/W1996073274","https://openalex.org/W2001532889","https://openalex.org/W2002658910","https://openalex.org/W2005509629","https://openalex.org/W2010042187","https://openalex.org/W2019062750","https://openalex.org/W2022155283","https://openalex.org/W2035442052","https://openalex.org/W2041025394","https://openalex.org/W2042803872","https://openalex.org/W2043260929","https://openalex.org/W2045492898","https://openalex.org/W2052371896","https://openalex.org/W2063844956","https://openalex.org/W2064933851","https://openalex.org/W2069417991","https://openalex.org/W2074920973","https://openalex.org/W2080024126","https://openalex.org/W2088622619","https://openalex.org/W2089117840","https://openalex.org/W2094067695","https://openalex.org/W2094122556","https://openalex.org/W2103363383","https://openalex.org/W2108031738","https://openalex.org/W2126874118","https://openalex.org/W2129239025","https://openalex.org/W2132651631","https://openalex.org/W2135424293","https://openalex.org/W2140118062","https://openalex.org/W2140262267","https://openalex.org/W2140322654","https://openalex.org/W2144053122","https://openalex.org/W2149178517","https://openalex.org/W2170344325","https://openalex.org/W2382162305","https://openalex.org/W2561675875","https://openalex.org/W2593701861","https://openalex.org/W2610183793","https://openalex.org/W2612171860","https://openalex.org/W2614622533","https://openalex.org/W2757107770","https://openalex.org/W2912794399","https://openalex.org/W2949112927","https://openalex.org/W2950535090","https://openalex.org/W2951079895","https://openalex.org/W2951496501","https://openalex.org/W2951858218","https://openalex.org/W2963004851","https://openalex.org/W3098952651","https://openalex.org/W3136714316","https://openalex.org/W4245298853","https://openalex.org/W4248079359","https://openalex.org/W4251076636"],"related_works":["https://openalex.org/W4297782750","https://openalex.org/W1581136457","https://openalex.org/W2800564468","https://openalex.org/W657822","https://openalex.org/W164187068","https://openalex.org/W2986071419","https://openalex.org/W2963004851","https://openalex.org/W4300049198","https://openalex.org/W2767991626","https://openalex.org/W2112227729"],"abstract_inverted_index":{"Column-sparse":[0],"packing":[1,57,72],"problems":[2],"arise":[3],"in":[4,7],"several":[5],"contexts":[6],"both":[8],"deterministic":[9],"and":[10,21,68,79,95],"stochastic":[11,69],"discrete":[12],"optimization.":[13],"We":[14],"present":[15],"two":[16],"unifying":[17],"ideas,":[18],"(non-uniform)":[19],"attenuation":[20],"multiple-chance":[22],"algorithms":[23,29],",":[24,66,77,102],"to":[25,47,85],"obtain":[26],"improved":[27],"approximation":[28],"for":[30,50,54,87],"some":[31],"well-known":[32],"families":[33],"of":[34,64,92],"such":[35],"problems.":[36],"As":[37],"three":[38],"main":[39],"examples,":[40],"we":[41],"attain":[42],"the":[43,82],"integrality":[44],"gap,":[45],"up":[46],"lower-order":[48],"terms,":[49],"known":[51],"LP":[52],"relaxations":[53],"k":[55,70],"-column-sparse":[56],"integer":[58],"programs":[59],"(Bansal":[60,73],"et":[61,74],"al.,":[62,75],"Theory":[63],"Computing":[65],"2012)":[67],"-set":[71],"Algorithmica":[76],"2012),":[78],"go":[80],"\u201chalf":[81],"remaining":[83],"distance\u201d":[84],"optimal":[86],"a":[88],"major":[89],"integrality-gap":[90],"conjecture":[91],"F\u00fcredi,":[93],"Kahn,":[94],"Seymour":[96],"on":[97],"hypergraph":[98],"matching":[99],"(":[100],"Combinatorica":[101],"1993).":[103]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}