{"id":"https://openalex.org/W1849484511","doi":"https://doi.org/10.1137/140981290","title":"Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets","display_name":"Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1849484511","doi":"https://doi.org/10.1137/140981290","mag":"1849484511"},"language":"en","primary_location":{"id":"doi:10.1137/140981290","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140981290","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5110616567","display_name":"Prachi Goyal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Prachi Goyal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069283977","display_name":"Neeldhara Misra","orcid":"https://orcid.org/0000-0003-1727-5388"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neeldhara Misra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060986039","display_name":"Fahad Panolan","orcid":"https://orcid.org/0000-0001-6213-8687"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fahad Panolan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5082025487","display_name":"Meirav Zehavi","orcid":"https://orcid.org/0000-0002-3636-5322"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Meirav Zehavi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1175,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.87359027,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"4","first_page":"1815","last_page":"1836"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9944999814033508,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9909999966621399,"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/disjoint-sets","display_name":"Disjoint sets","score":0.8318207263946533},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7391040325164795},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6476610898971558},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4806874692440033},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.44822579622268677},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41327595710754395},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06032460927963257}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8318207263946533},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7391040325164795},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6476610898971558},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4806874692440033},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.44822579622268677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41327595710754395},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06032460927963257}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/140981290","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140981290","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:eprints.iisc.ac.in:53160","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196309","display_name":"NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59270414","host_organization_name":"Indian Institute of Science Bangalore","host_organization_lineage":["https://openalex.org/I59270414"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","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":8,"referenced_works":["https://openalex.org/W2034011726","https://openalex.org/W2051064851","https://openalex.org/W2068795011","https://openalex.org/W2085521211","https://openalex.org/W2092088134","https://openalex.org/W2106097003","https://openalex.org/W2107174677","https://openalex.org/W2296148711"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W1968154277","https://openalex.org/W2160145947","https://openalex.org/W2383908414"],"abstract_inverted_index":{"In":[0],"this":[1,209],"work,":[2],"we":[3,133,192,225],"study":[4],"the":[5,36,60,100,108,112,127,136,148,187,233,241],"well-known":[6],"$r$-Dimensional":[7],"$k$-Matching":[8],"($(r,k)$-DM),":[9],"and":[10,25,54,81,114,145,147,165,238],"$r$-Set":[11],"$k$-Packing":[12],"($(r,k)$-SP)":[13],"problems.":[14,252],"Given":[15,50],"a":[16,43,51,67,87,115,180,194],"universe":[17,52],"$U":[18],":=":[19],"U_1":[20,31],"\\uplus":[21,23],"\\cdots":[22,33],"U_r$":[24],"an":[26,55,212],"$r$-uniform":[27,56],"family":[28,57],"$\\mathcal{F}":[29],"\\subseteq":[30],"\\times":[32,34],"U_r$,":[35],"$(r,k)$-DM":[37,144,164,237],"problem":[38,62],"asks":[39,63],"if":[40,64],"$\\mathcal{F}$":[41,65],"admits":[42,66],"collection":[44,68],"of":[45,69,103,130,163,183,189,215,228,236,246],"$k$":[46,70],"mutually":[47,71],"disjoint":[48,72],"sets.":[49,73,185],"$U$":[53],"$\\mathcal{F}\\subseteq":[58],"2^U$,":[59],"$(r,k)$-SP":[61,146,166],"We":[74,158,206],"employ":[75],"techniques":[76],"based":[77],"on":[78,160],"dynamic":[79],"programming":[80],"representative":[82,184,216],"families.":[83],"This":[84],"leads":[85],"to":[86,167],"deterministic":[88,116,140],"algorithm":[89,117,196,210],"with":[90,118,220],"running":[91,119,141,152,199],"time":[92,120,201],"$\\mathcal{O}":[93],"(2.851^{(r-1)k}\\cdot|\\mathcal{F}|\\cdot":[94],"n\\log^2":[95,122,204],"n\\cdot":[96,123],"\\log":[97,124],"W)$":[98,125,231,249],"for":[99,126,143,154,197,232,250],"weighted":[101,128,156,234],"version":[102,129],"$(r,k)$-DM,":[104],"where":[105],"$W$":[106],"is":[107],"maximum":[109],"weight":[110],"in":[111,200,218],"input,":[113],"$\\mathcal{O}(2.851^{(r-0.5501)k}\\cdot|\\mathcal{F}|\\cdot":[121],"$(r,k)$-SP.":[131],"Thus,":[132],"significantly":[134],"improve":[135],"previous":[137,149,242],"best":[138,150,243],"known":[139,151,244],"times":[142,153],"their":[155],"versions.":[157],"rely":[159],"structural":[161],"properties":[162],"develop":[168],"algorithms":[169],"that":[170,175,208],"are":[171],"faster":[172],"than":[173],"those":[174],"can":[176],"be":[177],"obtained":[178],"by":[179],"standard":[181],"use":[182],"Incorporating":[186],"principles":[188],"iterative":[190],"expansion,":[191],"obtain":[193],"better":[195],"$(3,k)$-DM,":[198],"$\\mathcal{O}(2.004^{3k}\\cdot|\\mathcal{F}|":[202],"\\cdot":[203],"n)$.":[205],"believe":[207],"demonstrates":[211],"interesting":[213],"application":[214],"families":[217],"conjunction":[219],"more":[221],"traditional":[222],"techniques.":[223],"Furthermore,":[224],"present":[226],"kernels":[227,245],"size":[229,247],"$\\mathcal{O}(e^rr(k-1)^r\\log":[230],"versions":[235],"$(r,k)$-SP,":[239],"improving":[240],"$\\mathcal{O}(r!r(k-1)^r\\log":[248],"these":[251]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}