{"id":"https://openalex.org/W1547559421","doi":"https://doi.org/10.1007/3-540-44676-1_37","title":"Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode","display_name":"Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1547559421","doi":"https://doi.org/10.1007/3-540-44676-1_37","mag":"1547559421"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44676-1_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44676-1_37","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/A5110465085","display_name":"Pierre Fraigniaud","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Pierre Fraigniaud","raw_affiliation_strings":["CNRS-LRI, Universit\u00e9 Paris-Sud, France"],"affiliations":[{"raw_affiliation_string":"CNRS-LRI, Universit\u00e9 Paris-Sud, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110465085"],"corresponding_institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I4210144804"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.1784,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.93283133,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"440","last_page":"451"},"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.9995999932289124,"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.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.998199999332428,"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.9979000091552734,"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/disjoint-sets","display_name":"Disjoint sets","score":0.6850451827049255},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6609851121902466},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.64805668592453},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6038328409194946},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5981084108352661},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5925570130348206},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.5279998779296875},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5273479223251343},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4773183763027191},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4302803874015808},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4051356613636017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40061426162719727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3186485171318054},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2978934645652771}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6850451827049255},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6609851121902466},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.64805668592453},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6038328409194946},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5981084108352661},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5925570130348206},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.5279998779296875},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5273479223251343},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4773183763027191},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4302803874015808},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4051356613636017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40061426162719727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3186485171318054},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2978934645652771},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-44676-1_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44676-1_37","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.8026","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.8026","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lri.fr/~pierre/POSTSCRIPTS/esa01.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W145809138","https://openalex.org/W1504569462","https://openalex.org/W1538663268","https://openalex.org/W1551152239","https://openalex.org/W1884713474","https://openalex.org/W1918603512","https://openalex.org/W1971853029","https://openalex.org/W2045371181","https://openalex.org/W2047083855","https://openalex.org/W2048266612","https://openalex.org/W2049131723","https://openalex.org/W2053102042","https://openalex.org/W2058322021","https://openalex.org/W2063002781","https://openalex.org/W2064907924","https://openalex.org/W2066700938","https://openalex.org/W2070433444","https://openalex.org/W2074417667","https://openalex.org/W2080750094","https://openalex.org/W2083990694","https://openalex.org/W2092660640","https://openalex.org/W2119585462","https://openalex.org/W2143996311","https://openalex.org/W2155761755","https://openalex.org/W2157066436","https://openalex.org/W2158927887","https://openalex.org/W4294337875","https://openalex.org/W6673589791"],"related_works":["https://openalex.org/W2160145947","https://openalex.org/W2113270940","https://openalex.org/W2004283824","https://openalex.org/W2963158951","https://openalex.org/W2070751425","https://openalex.org/W1581210843","https://openalex.org/W1982530285","https://openalex.org/W2085573573","https://openalex.org/W1992104669","https://openalex.org/W2118860231"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}