{"id":"https://openalex.org/W2116017213","doi":"https://doi.org/10.1109/glocom.2003.1258911","title":"Primal-dual algorithms for QoS multimedia multicast","display_name":"Primal-dual algorithms for QoS multimedia multicast","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2116017213","doi":"https://doi.org/10.1109/glocom.2003.1258911","mag":"2116017213"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2003.1258911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","raw_type":"proceedings-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/A5030046558","display_name":"Grui\u0103 C\u00e4linescu","orcid":"https://orcid.org/0000-0002-0925-9524"},"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":"G. Calinescu","raw_affiliation_strings":["Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA","institution_ids":["https://openalex.org/I180949307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003834309","display_name":"Cristina G. Fernandes","orcid":"https://orcid.org/0000-0002-5259-2859"},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"C.G. Fernandes","raw_affiliation_strings":["Department of Computer Science, University of S\u00e3o Paulo, Sao Paulo, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of S\u00e3o Paulo, Sao Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014788373","display_name":"Ion M\u0103ndoiu","orcid":"https://orcid.org/0000-0002-4818-0237"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I.I. Mandoiu","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005863931","display_name":"Alex Olshevsky","orcid":"https://orcid.org/0000-0002-5852-9789"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Olshevsky","raw_affiliation_strings":["Department of Electrical Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101876507","display_name":"Kai Yang","orcid":"https://orcid.org/0009-0006-2204-548X"},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Yang","raw_affiliation_strings":["Department of Computer Science, Georgia State University, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Georgia State University, Atlanta, GA, USA","institution_ids":["https://openalex.org/I181565077"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072751459","display_name":"Alex Zelikovsky","orcid":"https://orcid.org/0000-0003-4424-4691"},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Zelikovsky","raw_affiliation_strings":["Department of Computer Science, Georgia State University, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Georgia State University, Atlanta, GA, USA","institution_ids":["https://openalex.org/I181565077"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7486,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78524853,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"36","issue":null,"first_page":"3631","last_page":"3635"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9994000196456909,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.998199999332428,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7939503192901611},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.7909578084945679},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7470252513885498},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6308466196060181},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5684232711791992},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4958561360836029},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.4594806432723999},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4354253113269806},{"id":"https://openalex.org/keywords/dual-graph","display_name":"Dual graph","score":0.4231218695640564},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.4220491051673889},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.41255372762680054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3831484615802765},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37578901648521423},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3701409101486206},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3483177423477173},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32658809423446655},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19830089807510376},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.11877429485321045}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7939503192901611},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.7909578084945679},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7470252513885498},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6308466196060181},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5684232711791992},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4958561360836029},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.4594806432723999},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4354253113269806},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.4231218695640564},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.4220491051673889},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.41255372762680054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3831484615802765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37578901648521423},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3701409101486206},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3483177423477173},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32658809423446655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19830089807510376},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.11877429485321045},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/glocom.2003.1258911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.129.1282","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.1282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://suez.cs.gsu.edu/~cscazz/postscript/globecom03.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.2953","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.2953","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csam.iit.edu/~calinesc/qos25.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1536432301","https://openalex.org/W1544515183","https://openalex.org/W1583469196","https://openalex.org/W1642957770","https://openalex.org/W1990327548","https://openalex.org/W1998126097","https://openalex.org/W2062268671","https://openalex.org/W2062939617","https://openalex.org/W2065461399","https://openalex.org/W2097536156","https://openalex.org/W2104060777","https://openalex.org/W2127240180","https://openalex.org/W2155766772","https://openalex.org/W2166418855","https://openalex.org/W2169396071","https://openalex.org/W6647811010"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W3184075718","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2404561224"],"abstract_inverted_index":{"The":[0],"QoS":[1],"Steiner":[2,77],"tree":[3,78,100],"problem":[4],"asks":[5],"for":[6,125],"the":[7,27,40,45,54,71,80,83,99,108,112,126,134,149],"most":[8],"cost-efficient":[9],"way":[10],"to":[11,14,74,88],"multicast":[12],"multimedia":[13],"a":[15,31,49,56,60,68,76,138],"heterogeneous":[16],"collection":[17],"of":[18,29,62,86,90,148,153],"users":[19],"with":[20,51,67],"different":[21],"consumption":[22],"rates.":[23],"We":[24],"assume":[25],"that":[26,94],"cost":[28],"using":[30],"link":[32],"is":[33,73],"not":[34],"constant,":[35],"but":[36],"rather":[37],"depends":[38],"on":[39,53,133],"maximum":[41],"bandwidth":[42,69,87,102,109],"routed":[43],"through":[44],"link.":[46],"Formally,":[47],"given":[48],"graph":[50],"costs":[52],"edges,":[55],"source":[57,81],"node":[58],"and":[59,82,152],"set":[61],"terminal":[63],"nodes,":[64],"each":[65,89,95],"one":[66],"requirement,":[70],"goal":[72],"find":[75],"containing":[79],"cheapest":[84],"assignment":[85],"its":[91],"edges":[92],"so":[93],"source-to-terminal":[96],"path":[97],"in":[98],"has":[101],"at":[103],"least":[104],"as":[105,107],"large":[106],"required":[110],"by":[111],"terminal.":[113],"Our":[114],"main":[115],"contributions":[116],"are:":[117],"(1)":[118],"new":[119,130,150],"covering-type":[120],"integer":[121],"linear":[122],"program":[123],"formulations":[124],"problem;":[127],"(2)":[128],"two":[129],"heuristics":[131,151],"based":[132],"primal-dual":[135,139],"framework;":[136],"(3)":[137],"constant-factor":[140],"approximation":[141],"algorithm;":[142],"(4)":[143],"an":[144],"extensive":[145],"experimental":[146],"study":[147],"several":[154],"previously":[155],"proposed":[156],"algorithms.":[157]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}