{"id":"W2068568045","doi":"10.1016/j.tcs.2009.05.031","title":"Size-constrained tree partitioning: Approximating the multicast<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-tree routing problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Tree (set theory); Routing (electronic design automation); Computer science; Node (physics); Algorithm; Steiner tree problem; Mathematics; Discrete mathematics; Combinatorics; 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.001440826,0.0008475569,0.0008972137,0.0007683731,0.0004620588,0.0009365625,0.001755137,0.001459067,0.004303201],"category_scores_gemma":[0.008085232,0.0004934229,0.0005738477,0.001047692,0.000607287,0.002012097,0.00111624,0.001226009,0.0006342633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001485493,"about_ca_system_score_gemma":0.001139958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007748044,"about_ca_topic_score_gemma":0.007567626,"domain_scores_codex":[0.9995733,0.0001831757,0.00001216653,0.00005728412,0.0001027808,0.00007125419],"domain_scores_gemma":[0.9978999,0.001540301,0.0001148879,0.0001643336,0.0001742206,0.0001063343],"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.000276707,0.00007826667,0.0006768782,0.0001760352,0.00002840606,0.00007368955,0.0001117071,0.8993298,0.001444973,0.03460206,0.01212105,0.05108048],"study_design_scores_gemma":[0.00001586414,0.00001985193,0.00007029829,0.00001140899,0.000005037121,0.00001950392,0.00001712571,0.9861298,0.0002123811,0.01293214,0.0005642687,0.000002392617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08611845,0.001161391,0.8956257,0.001204624,0.0001241973,0.0001033239,0.0005742873,0.0005509481,0.01453701],"genre_scores_gemma":[0.5383459,0.0008538981,0.4510695,0.0003536467,0.0001486751,0.0002306509,0.001129461,0.0004595584,0.007408682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007748044,"threshold_uncertainty_score":0.01540589,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01088862861760366,"score_gpt":0.2280924622756602,"score_spread":0.2172038336580565,"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."}}