{"id":"https://openalex.org/W1664038012","doi":"https://doi.org/10.1109/isit.2015.7282515","title":"Sparse group covers and greedy tree approximations","display_name":"Sparse group covers and greedy tree approximations","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1664038012","doi":"https://doi.org/10.1109/isit.2015.7282515","mag":"1664038012"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282515","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282515","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/record/207825/files/Satpathi_Baldassarre_Cevher-Group_Sparse-ISIT_2015.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039591285","display_name":"Siddhartha Satpathi","orcid":"https://orcid.org/0000-0001-5359-7793"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Siddhartha Satpathi","raw_affiliation_strings":["Indian Institute of Technology, Kharagpur, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026055401","display_name":"Luca Baldassarre","orcid":"https://orcid.org/0000-0002-8050-2048"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Luca Baldassarre","raw_affiliation_strings":["LIONS - EPFL, Lausanne, Switzerland","LIONS, EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"LIONS - EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"LIONS, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027059837","display_name":"Volkan Cevher","orcid":"https://orcid.org/0000-0002-5004-201X"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Volkan Cevher","raw_affiliation_strings":["LIONS - EPFL, Lausanne, Switzerland","LIONS, EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"LIONS - EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"LIONS, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039591285"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03223865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":null,"first_page":"551","last_page":"555"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9894000291824341,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9800000190734863,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.779274582862854},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.672487735748291},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.6700765490531921},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6578742265701294},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48499390482902527},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4722268581390381},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4613369405269623},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4316653907299042},{"id":"https://openalex.org/keywords/wavelet","display_name":"Wavelet","score":0.4123801589012146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3253350853919983},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3016229569911957},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09833469986915588}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.779274582862854},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.672487735748291},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.6700765490531921},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6578742265701294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48499390482902527},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4722268581390381},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4613369405269623},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4316653907299042},{"id":"https://openalex.org/C47432892","wikidata":"https://www.wikidata.org/wiki/Q831390","display_name":"Wavelet","level":2,"score":0.4123801589012146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3253350853919983},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3016229569911957},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09833469986915588}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2015.7282515","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282515","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.tind.io:207825","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/113826","pdf_url":"https://infoscience.epfl.ch/record/207825/files/Satpathi_Baldassarre_Cevher-Group_Sparse-ISIT_2015.pdf","source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference proceedings"},{"id":"pmh:oai:infoscience.epfl.ch:207825","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/207825","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:infoscience.tind.io:207825","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/113826","pdf_url":"https://infoscience.epfl.ch/record/207825/files/Satpathi_Baldassarre_Cevher-Group_Sparse-ISIT_2015.pdf","source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1664038012.pdf","grobid_xml":"https://content.openalex.org/works/W1664038012.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1539012881","https://openalex.org/W1601795611","https://openalex.org/W1663973292","https://openalex.org/W1962147060","https://openalex.org/W1970554427","https://openalex.org/W1987371344","https://openalex.org/W2009234246","https://openalex.org/W2015780581","https://openalex.org/W2033289745","https://openalex.org/W2044762091","https://openalex.org/W2080379754","https://openalex.org/W2098110139","https://openalex.org/W2108687351","https://openalex.org/W2115755118","https://openalex.org/W2125680629","https://openalex.org/W2130410032","https://openalex.org/W2134929491","https://openalex.org/W2138019504","https://openalex.org/W2138597123","https://openalex.org/W2164431108","https://openalex.org/W2281354239","https://openalex.org/W3125735862","https://openalex.org/W3181761506","https://openalex.org/W6632282575","https://openalex.org/W6641049134","https://openalex.org/W6676634215","https://openalex.org/W6680646936","https://openalex.org/W6797817604"],"related_works":["https://openalex.org/W2357796514","https://openalex.org/W2393014972","https://openalex.org/W2357595179","https://openalex.org/W2896347948","https://openalex.org/W2351136238","https://openalex.org/W2402949237","https://openalex.org/W2891162720","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W3204684126"],"abstract_inverted_index":{"We":[0,41],"consider":[1],"the":[2,14,17,20,34,43,78,103,107,120,125,129],"problem":[3,32,111],"of":[4,9,16,22,36,45,80,86,124,128,132],"finding":[5,37],"a":[6,10,25,49],"K-sparse":[7,38],"approximation":[8,18,84],"signal,":[11],"such":[12],"that":[13],"support":[15],"is":[19,68,90],"union":[21],"sets":[23],"from":[24,102],"given":[26],"collection,":[27],"a.k.a.":[28],"group":[29,55],"structure.":[30],"This":[31],"subsumes":[33],"one":[35],"tree":[39,81,126],"approximations.":[40],"discuss":[42],"tractability":[44],"this":[46],"problem,":[47],"present":[48],"polynomial-time":[50],"dynamic":[51],"program":[52],"for":[53,106],"special":[54],"structures":[56],"and":[57,112],"propose":[58],"two":[59],"novel":[60],"greedy":[61,104],"algorithms":[62],"with":[63,74],"efficient":[64],"implementations.":[65],"The":[66,97],"first":[67],"based":[69],"on":[70],"submodular":[71],"function":[72],"maximization":[73],"knapsack":[75],"constraints.":[76],"For":[77],"case":[79],"sparsity,":[82],"its":[83],"ratio":[85],"1":[87],"-":[88],"1/e":[89],"better":[91],"than":[92],"current":[93],"state-of-the-art":[94],"approximate":[95],"algorithms.":[96],"second":[98],"algorithm":[99,105],"leverages":[100],"ideas":[101],"Budgeted":[108],"Maximum":[109],"Coverage":[110],"obtains":[113],"excellent":[114],"empirical":[115],"performance,":[116],"shown":[117],"by":[118],"computing":[119],"full":[121],"Pareto":[122],"frontier":[123],"approximations":[127],"wavelet":[130],"coefficients":[131],"an":[133],"image.":[134]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}