{"id":"https://openalex.org/W7166697977","doi":"https://doi.org/10.48550/arxiv.2606.28599","title":"Algorithms for the Maximum Edge Open Packing Problem","display_name":"Algorithms for the Maximum Edge Open Packing Problem","publication_year":2026,"publication_date":"2026-06-26","ids":{"openalex":"https://openalex.org/W7166697977","doi":"https://doi.org/10.48550/arxiv.2606.28599"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.28599","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28599","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.28599","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026582734","display_name":"Sriram Bhyravarapu","orcid":"https://orcid.org/0000-0001-5479-1950"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bhyravarapu, Sriram","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002203026","display_name":"Gautam Das","orcid":"https://orcid.org/0000-0002-4627-9065"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Das, Gautam K.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5032937760","display_name":"Kamal Santra","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Santra, Kamal","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.5601999759674072,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.5601999759674072,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.21050000190734863,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.029500000178813934,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.6617000102996826},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6603000164031982},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.5648000240325928},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4691999852657318},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4503999948501587},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.448199987411499},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4174000024795532},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4133000075817108},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4083999991416931},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.37549999356269836}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6617000102996826},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6603000164031982},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5841000080108643},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.5648000240325928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4708000123500824},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4691999852657318},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4503999948501587},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.448199987411499},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4174000024795532},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4133000075817108},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4083999991416931},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3953999876976013},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.37549999356269836},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3702000081539154},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.36070001125335693},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.349700003862381},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3465999960899353},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.3440999984741211},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3407000005245209},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3384000062942505},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3158000111579895},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30959999561309814},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.3070000112056732},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.29030001163482666},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.28130000829696655},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.2750000059604645},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.2734000086784363},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.27149999141693115},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.2712000012397766},{"id":"https://openalex.org/C127964446","wikidata":"https://www.wikidata.org/wiki/Q1092142","display_name":"Computational resource","level":3,"score":0.2712000012397766},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.26109999418258667}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.28599","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28599","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.28599","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28599","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Packing":[0,122],"problems":[1],"form":[2],"a":[3,40,50,63,70,84,98,107,126,157,188],"central":[4],"theme":[5],"in":[6,13,26,34,132,163,202],"graph":[7,64],"theory,":[8],"owing":[9],"to":[10,67,165],"their":[11,136],"relevance":[12],"modeling":[14],"conflict-free":[15],"resource":[16],"allocation,":[17],"network":[18],"design,":[19],"and":[20,42,186],"communication":[21,38],"constraints.":[22],"Motivated":[23],"by":[24,196],"applications":[25],"wireless":[27],"networks":[28],"where":[29],"each":[30],"device":[31],"can":[32],"participate":[33],"at":[35,39],"most":[36],"one":[37,74],"time":[41],"simultaneous":[43],"links":[44],"must":[45],"avoid":[46],"interference":[47],"we":[48,112,177],"consider":[49],"generalization":[51],"of":[52,62,76,86,96,106,117,169,183],"induced":[53],"matching":[54],"known":[55,167],"as":[56],"\\emph{edge":[57,79,102],"open":[58,80,103],"packing}.":[59],"Two":[60],"edges":[61,87],"are":[65],"said":[66],"conflict":[68],"if":[69],"third":[71],"edge":[72],"connects":[73],"endpoint":[75],"each;":[77],"an":[78],"packing":[81,104],"set}":[82],"is":[83,100],"set":[85,99],"containing":[88],"no":[89],"such":[90,97],"conflicting":[91],"pair.":[92],"The":[93],"largest":[94],"cardinality":[95],"the":[101,114,118,130,146,166,170,179,184,197],"number}":[105],"graph.":[108],"In":[109],"this":[110],"work,":[111],"study":[113,182],"computational":[115],"complexity":[116,181],"Maximum":[119],"Edge":[120],"Open":[121],"Problem.":[123],"We":[124,142],"give":[125],"polynomial-time":[127,149],"algorithm":[128,191],"for":[129,192],"problem":[131,147,171,185],"\\emph{distance-hereditary":[133],"graphs},":[134,154,194],"exploiting":[135],"canonical":[137],"decomposition":[138],"via":[139],"twin-set":[140],"interactions.":[141],"further":[143],"show":[144],"that":[145],"remains":[148],"solvable":[150],"on":[151,172],"\\emph{biconvex":[152],"bipartite":[153,161,174],"thereby":[155],"identifying":[156],"tractable":[158,190],"subclass":[159],"within":[160],"graphs,":[162],"contrast":[164],"NP-hardness":[168],"Eulerian":[173],"graphs.":[175],"Finally,":[176],"initiate":[178],"parameterized":[180,195],"present":[187],"fixed-parameter":[189],"\\emph{chordal":[193],"clique":[198],"number":[199],"$\u03c9$,":[200],"running":[201],"$O(2^\u03c9\\cdot\\mathrm{poly}(n))$":[203],"time.":[204]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-01T00:00:00"}