{"id":"https://openalex.org/W4415480647","doi":"https://doi.org/10.1145/3704413.3765321","title":"Poster: Sparsity-enhanced Lagrangian Relaxation (SeLR) for Computation Offloading at the Edge","display_name":"Poster: Sparsity-enhanced Lagrangian Relaxation (SeLR) for Computation Offloading at the Edge","publication_year":2025,"publication_date":"2025-10-23","ids":{"openalex":"https://openalex.org/W4415480647","doi":"https://doi.org/10.1145/3704413.3765321"},"language":null,"primary_location":{"id":"doi:10.1145/3704413.3765321","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704413.3765321","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3704413.3765321","source":null,"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-sixth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3704413.3765321","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018136001","display_name":"Negar Erfanian","orcid":"https://orcid.org/0000-0002-8049-0067"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Negar Erfaniantaghvayi","raw_affiliation_strings":["Rice University, Houston, USA"],"affiliations":[{"raw_affiliation_string":"Rice University, Houston, USA","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026528598","display_name":"Zhongyuan Zhao","orcid":"https://orcid.org/0000-0003-0346-8015"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhongyuan Zhao","raw_affiliation_strings":["Rice University, Houston, USA"],"affiliations":[{"raw_affiliation_string":"Rice University, Houston, USA","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057402438","display_name":"Kevin Chan","orcid":"https://orcid.org/0000-0002-6425-5403"},"institutions":[{"id":"https://openalex.org/I166416128","display_name":"DEVCOM Army Research Laboratory","ror":"https://ror.org/011hc8f90","country_code":"US","type":"government","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I166416128","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin Chan","raw_affiliation_strings":["US Army Research Laboratory, Maryland, USA"],"affiliations":[{"raw_affiliation_string":"US Army Research Laboratory, Maryland, USA","institution_ids":["https://openalex.org/I166416128"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103191815","display_name":"Ananthram Swami","orcid":"https://orcid.org/0000-0003-1439-332X"},"institutions":[{"id":"https://openalex.org/I166416128","display_name":"DEVCOM Army Research Laboratory","ror":"https://ror.org/011hc8f90","country_code":"US","type":"government","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I166416128","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ananthram Swami","raw_affiliation_strings":["DEVCOM Army Research Lab, Adelphi, USA"],"affiliations":[{"raw_affiliation_string":"DEVCOM Army Research Lab, Adelphi, USA","institution_ids":["https://openalex.org/I166416128"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012007074","display_name":"Santiago Segarra","orcid":"https://orcid.org/0000-0002-8408-9633"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Santiago Segarra","raw_affiliation_strings":["Rice University, Houston, USA"],"affiliations":[{"raw_affiliation_string":"Rice University, Houston, USA","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5018136001"],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":0.6751,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.74675374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"407","last_page":"408"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13052","display_name":"Molecular Communication and Nanonetworks","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T13052","display_name":"Molecular Communication and Nanonetworks","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9955999851226807,"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/scalability","display_name":"Scalability","score":0.6306999921798706},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5698000192642212},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.5558000206947327},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5533000230789185},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.538100004196167},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.512499988079071},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49050000309944153},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.48820000886917114},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4819999933242798},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.47839999198913574}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6931999921798706},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6306999921798706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6171000003814697},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5698000192642212},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.5558000206947327},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5533000230789185},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.538100004196167},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.512499988079071},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49050000309944153},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.48820000886917114},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4819999933242798},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.47839999198913574},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.44020000100135803},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4169999957084656},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3946000039577484},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.38530001044273376},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.37940001487731934},{"id":"https://openalex.org/C2781041963","wikidata":"https://www.wikidata.org/wiki/Q18348618","display_name":"Computation offloading","level":4,"score":0.3781000077724457},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3774999976158142},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3700000047683716},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.36980000138282776},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.3671000003814697},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3619000017642975},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.3571000099182129},{"id":"https://openalex.org/C2780554755","wikidata":"https://www.wikidata.org/wiki/Q955260","display_name":"Relaxation technique","level":3,"score":0.3402000069618225},{"id":"https://openalex.org/C79158427","wikidata":"https://www.wikidata.org/wiki/Q485396","display_name":"Analytics","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.30790001153945923},{"id":"https://openalex.org/C2778456923","wikidata":"https://www.wikidata.org/wiki/Q5337692","display_name":"Edge computing","level":3,"score":0.3066999912261963},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.2888999879360199},{"id":"https://openalex.org/C138236772","wikidata":"https://www.wikidata.org/wiki/Q25098575","display_name":"Edge device","level":3,"score":0.27970001101493835},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.27649998664855957},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.2759000062942505},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2678999900817871}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3704413.3765321","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704413.3765321","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3704413.3765321","source":null,"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-sixth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3704413.3765321","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704413.3765321","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3704413.3765321","source":null,"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-sixth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415480647.pdf","grobid_xml":"https://content.openalex.org/works/W4415480647.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W2107861471","https://openalex.org/W2183740130","https://openalex.org/W3083432504","https://openalex.org/W4206247378","https://openalex.org/W4211067533","https://openalex.org/W4311137534"],"related_works":[],"abstract_inverted_index":{"This":[0,30],"paper":[1],"proposes":[2],"an":[3],"efficient":[4],"approach":[5],"to":[6,47,92,104,114],"joint":[7],"task":[8,58],"offloading":[9],"and":[10,27,56,74,88,101,124],"routing":[11],"for":[12],"real-time":[13],"sensor":[14],"data":[15],"analytics":[16],"at":[17],"the":[18,41,48,81],"network":[19,51],"edge,":[20],"enabling":[21],"applications":[22],"such":[23],"as":[24,35],"video":[25],"surveillance":[26],"environmental":[28],"monitoring.":[29],"problem":[31],"can":[32],"be":[33],"formulated":[34],"a":[36,69,97],"mixed-integer":[37],"program":[38],"(MIP)":[39],"with":[40,121],"objective":[42],"of":[43,50,71],"utility":[44],"maximization":[45],"subject":[46],"constraints":[49],"topology,":[52],"limited":[53],"link":[54],"capacity,":[55],"diverse":[57],"profiles.":[59],"To":[60],"efficiently":[61],"approximate":[62],"this":[63],"NP-hard":[64],"problem,":[65],"we":[66],"propose":[67],"SeLR,":[68],"combination":[70],"primal-dual":[72],"optimization":[73],"reweighted":[75],"L1-norm":[76],"regularization,":[77],"which":[78],"iteratively":[79],"solves":[80],"convex":[82],"relaxation":[83],"while":[84],"penalizing":[85],"constraint":[86],"violations":[87],"encouraging":[89],"sparsity.":[90],"Compared":[91],"greedy":[93],"heuristics,":[94],"SeLR":[95],"provides":[96],"better":[98,102],"accuracy\u2014latency":[99],"trade-off":[100],"scalability":[103],"larger":[105],"problems.":[106],"Moreover,":[107],"it":[108],"reduces":[109],"scheduling":[110],"runtime":[111],"by":[112],"up":[113],"9.17\u00d7":[115],"over":[116],"optimal":[117],"solvers":[118],"in":[119],"networks":[120],"300":[122],"nodes":[123],"100":[125],"tasks.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-23T00:00:00"}