{"id":"https://openalex.org/W2995422874","doi":"https://doi.org/10.1142/s0219265919500063","title":"Approximation Algorithm for the Broadcast Time in <i>k</i>-Path Graph","display_name":"Approximation Algorithm for the Broadcast Time in <i>k</i>-Path Graph","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W2995422874","doi":"https://doi.org/10.1142/s0219265919500063","mag":"2995422874"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265919500063","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265919500063","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","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/A5015799882","display_name":"Puspal Bhabak","orcid":null},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"PUSPAL BHABAK","raw_affiliation_strings":["Department of Computer Science and Software Engineering, Concordia University, 1515 Saint Catherine St. West, Montreal, Quebec, H3G 1M8, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Concordia University, 1515 Saint Catherine St. West, Montreal, Quebec, H3G 1M8, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090172873","display_name":"Hovhannes A. Harutyunyan","orcid":"https://orcid.org/0000-0001-7260-4186"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"HOVHANNES A. HARUTYUNYAN","raw_affiliation_strings":["Department of Computer Science and Software Engineering, Concordia University, 1515 Saint Catherine St. West, Montreal, Quebec, H3G 1M8, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Concordia University, 1515 Saint Catherine St. West, Montreal, Quebec, H3G 1M8, Canada","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090172873"],"corresponding_institution_ids":["https://openalex.org/I60158472"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.19231676,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"19","issue":"04","first_page":"1950006","last_page":"1950006"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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.9983000159263611,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9976000189781189,"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/computer-science","display_name":"Computer science","score":0.6836480498313904},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5091685652732849},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48720186948776245},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4486064910888672},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44572699069976807},{"id":"https://openalex.org/keywords/broadcasting","display_name":"Broadcasting (networking)","score":0.4312761127948761},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4186832308769226},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.412957102060318},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4116877615451813},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3623083829879761},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3567899763584137},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3314628601074219},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3125138282775879},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21961849927902222}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6836480498313904},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5091685652732849},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48720186948776245},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4486064910888672},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44572699069976807},{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.4312761127948761},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4186832308769226},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.412957102060318},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4116877615451813},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3623083829879761},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3567899763584137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3314628601074219},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3125138282775879},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21961849927902222}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0219265919500063","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265919500063","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","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":14,"referenced_works":["https://openalex.org/W1918603512","https://openalex.org/W1982676876","https://openalex.org/W1988687643","https://openalex.org/W1998169461","https://openalex.org/W2008755444","https://openalex.org/W2010178885","https://openalex.org/W2017306767","https://openalex.org/W2027621249","https://openalex.org/W2045371181","https://openalex.org/W2058322021","https://openalex.org/W2060769243","https://openalex.org/W2080750094","https://openalex.org/W2083990694","https://openalex.org/W2091912668"],"related_works":["https://openalex.org/W2913171812","https://openalex.org/W2352278228","https://openalex.org/W1589070270","https://openalex.org/W2051673187","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"Broadcasting":[0],"is":[1,64,70],"an":[2,61],"information":[3],"dissemination":[4],"problem":[5,99],"in":[6,10,49,60,100,117],"a":[7,19,27,112,124],"connected":[8,86],"network":[9],"which":[11],"one":[12],"node,":[13],"called":[14],"the":[15,32,36,43,47,51,54,97,107,118,139],"originator,":[16],"must":[17],"distribute":[18],"message":[20],"to":[21],"all":[22],"other":[23],"nodes":[24,45],"by":[25],"placing":[26],"series":[28],"of":[29,35,41,57,81,90,106,132],"calls":[30],"along":[31],"communication":[33],"lines":[34],"network.":[37],"In":[38,92],"every":[39],"unit":[40],"time,":[42],"informed":[44],"aid":[46],"originator":[48,105],"distributing":[50],"message.":[52],"Finding":[53],"broadcast":[55,98,141],"time":[56,68,142],"any":[58,104],"vertex":[59],"arbitrary":[62],"graph":[63,109],"NP-complete.":[65],"The":[66,121],"polynomial":[67],"solvability":[69],"shown":[71],"only":[72],"for":[73,128,143],"certain":[74],"graphs":[75],"like":[76],"trees,":[77],"unicyclic":[78],"graphs,":[79,84],"tree":[80,89],"cycles,":[82],"necklace":[83],"fully":[85],"trees":[87],"and":[88],"cliques.":[91],"this":[93],"paper":[94],"we":[95,110],"study":[96],"k-path":[101,108,133],"graphs.":[102,134],"For":[103],"present":[111],"(4":[113],"\u2013":[114],"\u03f5)-approximation":[115],"algorithm":[116,122,137],"worst":[119],"case.":[120],"gives":[123],"better":[125],"approximation":[126],"ratio":[127],"some":[129,144],"large":[130],"classes":[131],"Moreover,":[135],"our":[136],"generates":[138],"optimal":[140],"cases.":[145]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}