{"id":"W2995422874","doi":"10.1142/s0219265919500063","title":"Approximation Algorithm for the Broadcast Time in <i>k</i>-Path Graph","year":2019,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Vertex (graph theory); Time complexity; Graph; Path (computing); Broadcasting (networking); Tree (set theory); Algorithm; Approximation algorithm; Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics; Computer network","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009818129,0.001497066,0.001474077,0.001088309,0.001079447,0.002054738,0.002761832,0.001746611,0.007892851],"category_scores_gemma":[0.005159565,0.000537101,0.001110345,0.002121246,0.0009311878,0.003349341,0.001403268,0.002339995,0.001691174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003588595,"about_ca_system_score_gemma":0.00362792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008433831,"about_ca_topic_score_gemma":0.008853127,"domain_scores_codex":[0.9986832,0.0002318577,0.00006642278,0.0003349097,0.0002589413,0.0004246692],"domain_scores_gemma":[0.9974395,0.001539518,0.0002352871,0.0003789543,0.00022431,0.0001824318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001971623,0.0009137096,0.003603831,0.0009274821,0.0002402621,0.0003574797,0.0007935665,0.6383487,0.01397823,0.05557393,0.03335742,0.2499338],"study_design_scores_gemma":[0.0002734094,0.0001580079,0.0004982487,0.00003836176,0.00006676318,0.0002706223,0.0001451286,0.9501097,0.002749813,0.04217562,0.003487643,0.00002662884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1171458,0.001486802,0.8538244,0.002447719,0.0002490717,0.0004031206,0.001391981,0.00437485,0.0186762],"genre_scores_gemma":[0.5028754,0.0006711382,0.4839073,0.0004439804,0.0001659646,0.0005030574,0.003028323,0.0006777095,0.007727145],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008433831,"threshold_uncertainty_score":0.0264042,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007086389217122757,"score_gpt":0.2160067141272689,"score_spread":0.2089203249101462,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}