{"id":"W2164903952","doi":"10.1007/s00453-012-9701-z","title":"Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Iterated function; Linear programming relaxation; Vertex (graph theory); Discrete mathematics; Reachability; Approximation algorithm; Packing problems; Steiner tree problem; Tree (set theory); Theory of computation; Graph; Linear programming; Mathematical optimization; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.0003894875,0.0001446915,0.0001668167,0.0001597937,0.0001319774,0.0001231952,0.0002978142,0.0000715927,0.00001002622],"category_scores_gemma":[0.00004803251,0.0001473066,0.0000365305,0.0004555464,0.00005033983,0.001065108,0.0002458554,0.0002083529,0.00001720394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000532482,"about_ca_system_score_gemma":0.00001284791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001016676,"about_ca_topic_score_gemma":0.00003766274,"domain_scores_codex":[0.9988468,0.00009172147,0.0002306284,0.0002735255,0.0001763028,0.0003810019],"domain_scores_gemma":[0.9993076,0.0001490258,0.0000730448,0.0003222085,0.00003369522,0.0001144764],"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.000007519799,0.0002246503,0.01260746,0.00002085945,0.00002097619,0.00001590271,0.004956915,0.0003307415,0.001038277,0.006411521,0.0000858398,0.9742793],"study_design_scores_gemma":[0.0004830448,0.00002921854,0.05077709,0.00003836699,0.000003711011,0.0000331578,0.00003033877,0.9422631,0.001120215,0.003895178,0.001098663,0.0002279597],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1787855,0.0002966765,0.8194151,0.0002710502,0.000588804,0.0001593122,0.000004851257,0.0001615194,0.0003171325],"genre_scores_gemma":[0.8519924,0.00001623175,0.1477248,0.0001098503,0.0001173377,0.00001043446,0.000006300592,0.000007911285,0.00001468694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9740514,"threshold_uncertainty_score":0.6006989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01798710330535585,"score_gpt":0.2393808425471846,"score_spread":0.2213937392418288,"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."}}