{"id":"W2087455919","doi":"10.1007/s10878-008-9150-4","title":"Packing trees in communication networks","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph; Canadian Imperial Bank of Commerce (Canada); McMaster University","funders":"","keywords":"Mathematics; Solver; Linear programming relaxation; Approximation algorithm; Multicast; Integer programming; Theory of computation; Steiner tree problem; Combinatorics; Spanning tree; Relaxation (psychology); Tree (set theory); Independent set; Block (permutation group theory); Time complexity; k-minimum spanning tree; Linear programming; Discrete mathematics; Graph; Computer science; Mathematical optimization; Algorithm; Tree structure; Binary tree; K-ary tree","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.000868017,0.0006448624,0.001628652,0.002148994,0.001947199,0.004315784,0.001423122,0.002880592,0.009074492],"category_scores_gemma":[0.009427005,0.001377745,0.0007175892,0.004847167,0.001965798,0.004925536,0.001656569,0.002858245,0.001156831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00139619,"about_ca_system_score_gemma":0.0008164817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001801864,"about_ca_topic_score_gemma":0.002201969,"domain_scores_codex":[0.9990993,0.0003366565,0.00004074967,0.0001235866,0.0002383796,0.0001614114],"domain_scores_gemma":[0.9943178,0.003979741,0.0005257152,0.000393747,0.000370675,0.000412373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009738487,0.00008681537,0.000696749,0.0001789256,0.00002905727,0.0001531683,0.0003269726,0.0653239,0.0009127246,0.8865372,0.01238363,0.03327355],"study_design_scores_gemma":[0.00001454267,0.00001907761,0.0002709019,0.00002956498,0.0000156046,0.0001115173,0.00008048544,0.1116172,0.0001905213,0.8840154,0.003626352,0.000008775285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3409415,0.009277644,0.5326977,0.006629342,0.001068018,0.0001838128,0.0008573199,0.0007079088,0.1076367],"genre_scores_gemma":[0.870014,0.007276326,0.08249624,0.0009024416,0.001179805,0.0002092783,0.0008978575,0.0003589548,0.0366651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009074492,"threshold_uncertainty_score":0.03035718,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01893529126758242,"score_gpt":0.2744476154568449,"score_spread":0.2555123241892625,"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."}}