{"id":"W1493404814","doi":"10.1007/11600930_69","title":"Packing Trees in Communication Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; McMaster University; University of Toronto","funders":"","keywords":"Linear programming relaxation; Integer programming; Steiner tree problem; Approximation algorithm; Solver; Relaxation (psychology); Spanning tree; Combinatorics; Linear programming; Time complexity; Block (permutation group theory); Set packing; Tree (set theory); Computer science; Multicast; Mathematics; Independent set; Graph; Set (abstract data type); Mathematical optimization","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.0002480711,0.0007263837,0.0010366,0.001289699,0.0008696573,0.002118557,0.0008021531,0.001173747,0.01069846],"category_scores_gemma":[0.001584831,0.0007918465,0.0004526449,0.004680616,0.001015766,0.003357217,0.00113125,0.002234434,0.003328786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007899213,"about_ca_system_score_gemma":0.000368203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005765859,"about_ca_topic_score_gemma":0.0006860649,"domain_scores_codex":[0.9997004,0.00007447273,0.00001372705,0.00004747233,0.0001234739,0.00004046572],"domain_scores_gemma":[0.9995551,0.0002332267,0.00003358534,0.00008737866,0.00005208232,0.00003867743],"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.00002256726,0.0000278903,0.00007696279,0.0002019502,0.00001016592,0.00007471622,0.0001866329,0.009109941,0.0008219008,0.8554356,0.02602245,0.1080092],"study_design_scores_gemma":[0.00000608575,0.00001771055,0.0001022677,0.00005550683,0.000009621918,0.0001767314,0.00004846112,0.0171133,0.0003312917,0.9322688,0.04986333,0.000006907992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03209671,0.03868223,0.5328528,0.003091471,0.002946704,0.0001523849,0.0004290484,0.001179186,0.3885695],"genre_scores_gemma":[0.3972135,0.05944217,0.2865593,0.001537466,0.004673164,0.0004538109,0.001560008,0.001051696,0.2475089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01069846,"threshold_uncertainty_score":0.03578997,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02363825283242386,"score_gpt":0.2889289885727813,"score_spread":0.2652907357403574,"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."}}