{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00196149,0.001116833,0.00178039,0.001414235,0.001269755,0.002853961,0.002331987,0.002304808,0.003498724],"category_scores_gemma":[0.009489791,0.001514946,0.002464234,0.00250443,0.002288783,0.006321055,0.002785797,0.003205506,0.0004123521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001479778,"about_ca_system_score_gemma":0.0009024299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002070906,"about_ca_topic_score_gemma":0.002086551,"domain_scores_codex":[0.9987258,0.0005471284,0.00005761743,0.0002302867,0.0002274495,0.000211742],"domain_scores_gemma":[0.9946338,0.004159125,0.0003544986,0.0004814426,0.0001579899,0.0002131964],"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.0002648421,0.0003257769,0.001381417,0.0004778255,0.0001207156,0.0002852805,0.0007198002,0.5111088,0.00320753,0.3998064,0.005787694,0.07651404],"study_design_scores_gemma":[0.00002780152,0.00005270803,0.0002593826,0.00004094318,0.00003860805,0.0001206812,0.00008695598,0.7137548,0.0007941158,0.2832581,0.001546871,0.00001897791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1260647,0.001572391,0.8545319,0.0008741213,0.0001019763,0.00008753188,0.0001293481,0.000194666,0.01644328],"genre_scores_gemma":[0.6058856,0.001825883,0.3833684,0.0002443116,0.0003574525,0.0002522398,0.000372184,0.0002611036,0.007432748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003498724,"threshold_uncertainty_score":0.01170444,"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."}}