{"id":"W1556245316","doi":"10.1007/978-3-540-85097-7_27","title":"An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":20,"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); Node (physics); Routing algorithm; Approximation algorithm; Algorithm; Mathematical optimization; Combinatorics; Computer network; Mathematics; Routing protocol; Physics","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.001186348,0.00146971,0.001757989,0.001191374,0.00097192,0.00188745,0.003889,0.002342135,0.01028571],"category_scores_gemma":[0.004904917,0.000724525,0.001145218,0.002688561,0.0006164843,0.00277368,0.002188857,0.002930606,0.001819271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002559261,"about_ca_system_score_gemma":0.002466758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005262652,"about_ca_topic_score_gemma":0.006309409,"domain_scores_codex":[0.9987063,0.0003043215,0.00005299452,0.0002347968,0.0004320609,0.000269537],"domain_scores_gemma":[0.9983371,0.0007970416,0.00009266318,0.0003587883,0.0002951322,0.0001191437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009744528,0.0006329007,0.0008042137,0.0003575937,0.0001084519,0.0001710801,0.0001770861,0.5137992,0.005839729,0.04516935,0.03509787,0.3968681],"study_design_scores_gemma":[0.000108782,0.00006273741,0.0001359016,0.00001500653,0.00002422635,0.00007257837,0.00002547808,0.9816803,0.0007303574,0.01423992,0.002893258,0.00001146807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0317178,0.000907213,0.9463011,0.001016741,0.0004090572,0.000245694,0.0004684036,0.002578534,0.01635552],"genre_scores_gemma":[0.1937973,0.0004585935,0.7946723,0.0003946198,0.0002680456,0.0004137268,0.001283755,0.0004093207,0.008302376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01028571,"threshold_uncertainty_score":0.03440911,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01449412608670588,"score_gpt":0.227576433408481,"score_spread":0.2130823073217751,"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."}}