{"id":"W2328826103","doi":"10.2316/journal.211.2012.1.211-1056","title":"APPROXIMATION ALGORITHMS FOR SP-MULTICAST TREES IN 2D GRIDS1","year":2012,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Multicast; Computer science; Protocol Independent Multicast; Algorithm; Computer network","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630463,0.001165872,0.001878957,0.001480153,0.001506778,0.002262847,0.003672706,0.002462802,0.006967018],"category_scores_gemma":[0.008753208,0.0008475609,0.00129085,0.003528634,0.000913408,0.004774257,0.00323966,0.002600866,0.001458608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002315421,"about_ca_system_score_gemma":0.001648222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004789002,"about_ca_topic_score_gemma":0.007471689,"domain_scores_codex":[0.9987056,0.0003922205,0.0000676702,0.000230081,0.0003467952,0.0002576514],"domain_scores_gemma":[0.9961495,0.002189582,0.0002272478,0.0008419359,0.0003608851,0.000230798],"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.001011129,0.0003720434,0.002206963,0.0005593703,0.0001382742,0.0001383674,0.0004104583,0.6863518,0.003821132,0.09728877,0.02485664,0.1828449],"study_design_scores_gemma":[0.00004687402,0.00003649488,0.0001326099,0.00001249353,0.00001285286,0.00004352844,0.00005093759,0.9457624,0.0005494889,0.05198561,0.001361013,0.000005802747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06927115,0.001214556,0.9159271,0.001543863,0.0002093373,0.0001921397,0.0007123345,0.001626425,0.009303055],"genre_scores_gemma":[0.3680326,0.0007836243,0.6218795,0.0003284472,0.0002366309,0.0003186992,0.001835245,0.0004163884,0.006168764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006967018,"threshold_uncertainty_score":0.02330697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01964743289847732,"score_gpt":0.2591272715088043,"score_spread":0.239479838610327,"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."}}