{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002440545,0.0003608726,0.0002948889,0.0001913087,0.0002345796,0.0001124643,0.0009086302,0.0003018137,0.000001417765],"category_scores_gemma":[0.00007137936,0.0002693193,0.00006472615,0.0002660005,0.0006715025,0.000257087,0.0001244096,0.0006625811,0.000002678931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002082378,"about_ca_system_score_gemma":0.00004331258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002935296,"about_ca_topic_score_gemma":0.00002715115,"domain_scores_codex":[0.9983369,0.000005558847,0.0003345077,0.0005577432,0.0002511885,0.0005140865],"domain_scores_gemma":[0.9985933,0.0005504864,0.00008527551,0.0005900434,0.000126687,0.00005415172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001123607,0.000003827973,4.441981e-7,0.00001265969,0.000006002917,0.000001944396,0.0001574927,0.3398861,0.0002984643,0.0002357159,0.000002574154,0.6593937],"study_design_scores_gemma":[0.0001747923,0.00009101451,0.000006816177,0.00009299685,0.000008525119,0.00001734695,8.307738e-7,0.9838694,0.0009980827,0.01420852,0.0002007374,0.0003308929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003207042,0.0002861604,0.9972625,0.00008020115,0.0004279304,0.0009177265,0.00001034315,0.0007032341,0.0002798312],"genre_scores_gemma":[0.03165622,0.00006741207,0.9678102,0.0000616756,0.0002578345,0.00005553561,0.00001130246,0.0000588162,0.00002100699],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6590628,"threshold_uncertainty_score":0.9999759,"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."}}