{"id":"https://openalex.org/W2092835661","doi":"https://doi.org/10.1109/infocom.2014.6848102","title":"Fast and simple approximation algorithms for maximum weighted independent set of links","display_name":"Fast and simple approximation algorithms for maximum weighted independent set of links","publication_year":2014,"publication_date":"2014-04-01","ids":{"openalex":"https://openalex.org/W2092835661","doi":"https://doi.org/10.1109/infocom.2014.6848102","mag":"2092835661"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2014.6848102","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2014.6848102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"},"type":"conference-paper","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/A5036031118","display_name":"Peng\u2010Jun Wan","orcid":"https://orcid.org/0000-0001-7926-5711"},"institutions":[{"id":"https://openalex.org/I180949307","display_name":"Illinois Institute of Technology","ror":"https://ror.org/037t3ry66","country_code":"US","type":"education","lineage":["https://openalex.org/I180949307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peng-Jun Wan","raw_affiliation_strings":["Deoartment of Comouter Science, Illinois Institute of Technology","Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Deoartment of Comouter Science, Illinois Institute of Technology","institution_ids":["https://openalex.org/I180949307"]},{"raw_affiliation_string":"Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA#TAB#","institution_ids":["https://openalex.org/I180949307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013643572","display_name":"Xiaohua Jia","orcid":"https://orcid.org/0000-0001-8702-8302"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Xiaohua Jia","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong","Department of Computer Science,City University of Hong Kong, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Computer Science,City University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101914306","display_name":"Guojun Dai","orcid":"https://orcid.org/0000-0002-4751-8427"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guojun Dai","raw_affiliation_strings":["School of Computer Science, Hangzhou DianZi University","School of Computer Science, Hangzhou Dianzi University, Hangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Hangzhou DianZi University","institution_ids":["https://openalex.org/I50760025"]},{"raw_affiliation_string":"School of Computer Science, Hangzhou Dianzi University, Hangzhou, China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077298638","display_name":"Hongwei Du","orcid":"https://orcid.org/0000-0002-5312-4037"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongwei Du","raw_affiliation_strings":["Department of Computer Science and Technology, HIT Shenzhen Graduate School","Shenzhen Grad. Sch., Dept. of Comput. Sci. & Technol., Harbin Inst. of Technol., Shenzhen, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, HIT Shenzhen Graduate School","institution_ids":[]},{"raw_affiliation_string":"Shenzhen Grad. Sch., Dept. of Comput. Sci. & Technol., Harbin Inst. of Technol., Shenzhen, China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110275365","display_name":"Ophir Frieder","orcid":null},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ophir Frieder","raw_affiliation_strings":["Department of Computer Science, Georgetown University","Dept. of Comput. Sci., Georgetown Univ., Georgetown, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Georgetown University","institution_ids":["https://openalex.org/I184565670"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Georgetown Univ., Georgetown, WA, USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1653","last_page":"1661"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998000264167786,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9988999962806702,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7777642011642456},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6930667757987976},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5498478412628174},{"id":"https://openalex.org/keywords/interference","display_name":"Interference (communication)","score":0.5217422246932983},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5061666369438171},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5040863752365112},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49533095955848694},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4563312232494354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45612916350364685},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.45554062724113464},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44307205080986023},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43000009655952454},{"id":"https://openalex.org/keywords/interference-alignment","display_name":"Interference alignment","score":0.4224061965942383},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.416730135679245},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3735921382904053},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10900485515594482},{"id":"https://openalex.org/keywords/mimo","display_name":"MIMO","score":0.08616474270820618}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7777642011642456},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6930667757987976},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5498478412628174},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.5217422246932983},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5061666369438171},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5040863752365112},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49533095955848694},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4563312232494354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45612916350364685},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45554062724113464},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44307205080986023},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43000009655952454},{"id":"https://openalex.org/C2982854036","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference alignment","level":4,"score":0.4224061965942383},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.416730135679245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3735921382904053},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10900485515594482},{"id":"https://openalex.org/C207987634","wikidata":"https://www.wikidata.org/wiki/Q176862","display_name":"MIMO","level":3,"score":0.08616474270820618},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2014.6848102","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2014.6848102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1901187898","https://openalex.org/W1995120351","https://openalex.org/W2069169587","https://openalex.org/W2080944301","https://openalex.org/W2106717724","https://openalex.org/W2116071440","https://openalex.org/W2134269213","https://openalex.org/W2148282413","https://openalex.org/W2156214642","https://openalex.org/W4251767568"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2098281589","https://openalex.org/W3204684126","https://openalex.org/W1982537107","https://openalex.org/W2962917430","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W2045237525","https://openalex.org/W173299344"],"abstract_inverted_index":{"Finding":[0],"a":[1,8,54,70,103,125],"maximum-weighted":[2],"independent":[3],"set":[4],"of":[5,44,83,127,146],"links":[6],"is":[7,29,82,88,102],"fundamental":[9],"problem":[10],"in":[11,18],"wireless":[12,20],"networking":[13],"and":[14,41,87,129],"has":[15,69],"broad":[16],"applications":[17],"various":[19],"link":[21],"scheduling":[22],"problems.":[23],"Under":[24],"protocol":[25,136,148],"interference":[26,39,100,112,137,149],"model,":[27,150],"it":[28,52,68],"NP-hard":[30],"even":[31],"when":[32],"all":[33,45],"nodes":[34,46],"have":[35],"uniform":[36,99],"(and":[37],"fixed)":[38],"radii":[40,101],"the":[42,93,98,110,134,142,147],"positions":[43],"are":[47,117],"available.":[48],"On":[49,92],"one":[50],"hand,":[51,95],"admits":[53],"polynomial-time":[55,71],"approximation":[56,131],"scheme":[57],"(PTAS).":[58],"In":[59,120],"other":[60,94],"words,":[61],"for":[62],"any":[63],"fixed":[64],"\u03b5":[65],">":[66],"0,":[67],"(depending":[72],"on":[73],"\u03b5)":[74],"(1":[75],"+":[76],"\u03b5)-approximation":[77],"algorithm.":[78],"However,":[79],"such":[80],"PTAS":[81],"theoretical":[84],"interest":[85],"only":[86,96],"quite":[89],"infeasible":[90],"practically.":[91],"with":[97],"simple":[104,130],"(greedy)":[105],"constant-approximation":[106,115],"algorithm":[107],"known.":[108],"For":[109],"arbitrary":[111],"radii,":[113],"fast":[114,128],"algorithms":[116,132,152],"still":[118],"missing.":[119],"this":[121],"paper,":[122],"we":[123],"present":[124],"number":[126],"under":[133],"general":[135],"model.":[138],"When":[139],"applied":[140],"to":[141],"plane":[143],"geometric":[144],"variants":[145],"these":[151],"produce":[153],"constant-approximate":[154],"solutions":[155],"efficiently.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}