{"id":"https://openalex.org/W2097734862","doi":"https://doi.org/10.1007/978-3-319-14974-5_3","title":"Constant Approximation for Broadcasting in k-cycle Graph","display_name":"Constant Approximation for Broadcasting in k-cycle Graph","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2097734862","doi":"https://doi.org/10.1007/978-3-319-14974-5_3","mag":"2097734862"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-14974-5_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-14974-5_3","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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":true,"raw_author_name":"Puspal Bhabak","raw_affiliation_strings":["Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, H3G 1M8, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, 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":false,"raw_author_name":"Hovhannes A. Harutyunyan","raw_affiliation_strings":["Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, H3G 1M8, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, H3G 1M8, Canada","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015799882"],"corresponding_institution_ids":["https://openalex.org/I60158472"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.08706247,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"21","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.996399998664856,"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/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"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/combinatorics","display_name":"Combinatorics","score":0.6186310052871704},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5533146262168884},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5147318840026855},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.500952959060669},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4556182026863098},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4280781149864197},{"id":"https://openalex.org/keywords/butterfly-graph","display_name":"Butterfly graph","score":0.4223238527774811},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35127758979797363},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23988956212997437},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.17793488502502441}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6186310052871704},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5533146262168884},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5147318840026855},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.500952959060669},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4556182026863098},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4280781149864197},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.4223238527774811},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35127758979797363},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23988956212997437},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.17793488502502441}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-14974-5_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-14974-5_3","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1536362626","https://openalex.org/W1884713474","https://openalex.org/W1918603512","https://openalex.org/W1988687643","https://openalex.org/W1992175439","https://openalex.org/W1998169461","https://openalex.org/W2004232248","https://openalex.org/W2008755444","https://openalex.org/W2010178885","https://openalex.org/W2017306767","https://openalex.org/W2027621249","https://openalex.org/W2045371181","https://openalex.org/W2060162472","https://openalex.org/W2060769243","https://openalex.org/W2083990694","https://openalex.org/W2091912668","https://openalex.org/W2119420156","https://openalex.org/W2169134333","https://openalex.org/W2493241760","https://openalex.org/W4250266522"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W3123242903","https://openalex.org/W2222736632","https://openalex.org/W4309875728","https://openalex.org/W1519201794","https://openalex.org/W2767824041","https://openalex.org/W1629505938","https://openalex.org/W2144493643","https://openalex.org/W4210656773","https://openalex.org/W2764219506"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}