{"id":"W2091897018","doi":"10.1016/j.tcs.2009.05.013","title":"A 3.4713-approximation algorithm for the capacitated multicast tree routing problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Multicast; Computer science; Routing (electronic design automation); Tree (set theory); Destination-Sequenced Distance Vector routing; Mathematics; Approximation algorithm; Algorithm; Link-state routing protocol; Combinatorics; Routing protocol; Distributed computing; 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.001370598,0.002005463,0.001833326,0.00148689,0.001485426,0.002687037,0.003553004,0.003147755,0.03674326],"category_scores_gemma":[0.004621152,0.0008469929,0.001864498,0.002931305,0.000672292,0.003944905,0.002612705,0.002608581,0.008689628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0046003,"about_ca_system_score_gemma":0.004792867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006893169,"about_ca_topic_score_gemma":0.009646923,"domain_scores_codex":[0.9980295,0.0003587693,0.0001046679,0.0004405631,0.0005613453,0.0005050442],"domain_scores_gemma":[0.9984493,0.0005877436,0.00009019384,0.000425195,0.0002840159,0.0001635129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003539125,0.001589852,0.001634676,0.000672107,0.0001918174,0.0002303691,0.0002831027,0.1579316,0.01430568,0.03745985,0.09684733,0.6853145],"study_design_scores_gemma":[0.001297782,0.0004174908,0.001430569,0.00009868872,0.0001629832,0.0004160926,0.0002357819,0.8877842,0.008333956,0.07063845,0.02910462,0.00007941759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1301299,0.003202804,0.7271202,0.005588826,0.001231157,0.001317061,0.004902327,0.01733607,0.1091716],"genre_scores_gemma":[0.2335973,0.0005562579,0.7296225,0.001197028,0.0002328705,0.0009435422,0.007379446,0.001264945,0.02520613],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03674326,"threshold_uncertainty_score":0.1229184,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02096250430777609,"score_gpt":0.2963531921596693,"score_spread":0.2753906878518932,"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."}}