{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003626126,0.0002354401,0.0002204169,0.0002163593,0.001194551,0.0007545466,0.003719599,0.00005638614,0.000005792391],"category_scores_gemma":[0.0002675184,0.0001545795,0.0001087376,0.002055052,0.002598508,0.001058022,0.0005262358,0.0003102125,0.00002690367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009255357,"about_ca_system_score_gemma":0.0001241478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001443555,"about_ca_topic_score_gemma":4.089557e-7,"domain_scores_codex":[0.9966722,0.0001616257,0.0003658348,0.0008669954,0.0009190909,0.001014298],"domain_scores_gemma":[0.9968921,0.001212602,0.0001037371,0.001047257,0.0004909549,0.0002533799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005882367,0.00003794219,0.000001034358,0.00000182486,0.000002588689,0.000001704101,0.0004239757,0.0001933464,0.0008643814,0.5779321,0.000009762367,0.4205254],"study_design_scores_gemma":[0.0002694532,0.0002535944,0.0001417357,0.00001585113,0.00000331975,0.00002282589,0.00001457202,0.6192824,0.00310148,0.3767184,0.00003546793,0.0001408564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00102268,0.00002581153,0.9931785,0.003210483,0.0002219776,0.0009199965,0.000002964119,0.0002968493,0.001120735],"genre_scores_gemma":[0.481356,0.000001594312,0.5181606,0.0003540169,0.00007995045,0.00002950462,7.163877e-7,0.000006080949,0.0000114534],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6190891,"threshold_uncertainty_score":0.9574311,"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."}}