{"id":"W2170344325","doi":"10.1145/1273340.1273343","title":"Multicommodity demand flow in a tree and packing integer programs","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Linear programming relaxation; Mathematics; Cardinality (data modeling); Multi-commodity flow problem; Integer programming; Knapsack problem; Mathematical optimization; Steiner tree problem; Tree (set theory); Combinatorics; Approximation algorithm; Integer (computer science); Flow network; Discrete mathematics; Computer science","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.0008299634,0.0001630176,0.0001700084,0.0003741796,0.0001741444,0.0001030519,0.0006771561,0.00008798343,0.000008763493],"category_scores_gemma":[0.00005131794,0.0001511194,0.00006019714,0.000794397,0.0001435926,0.000499631,0.00003486597,0.0004909243,0.00001483699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007405775,"about_ca_system_score_gemma":0.00002270806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004639013,"about_ca_topic_score_gemma":0.0006077131,"domain_scores_codex":[0.9984444,0.0000940029,0.0002376199,0.0004480414,0.0002964776,0.0004794484],"domain_scores_gemma":[0.9986227,0.00040342,0.00003339317,0.0007223401,0.00005616775,0.0001619557],"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.00002648632,0.0002216873,0.0004807498,0.000006921178,0.00001186787,0.00004143224,0.000672601,0.0003765463,0.0001342709,0.0006120903,0.000001339997,0.997414],"study_design_scores_gemma":[0.0052896,0.001076609,0.03032609,0.0002712829,0.00002260834,0.00022623,0.001409685,0.826274,0.01762548,0.1145313,0.001713072,0.001234068],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01987232,0.00007940295,0.978761,0.0005390912,0.0001531935,0.0003041287,0.000002392088,0.0001426431,0.0001458792],"genre_scores_gemma":[0.6837619,0.000028056,0.3160321,0.00007264566,0.00001491466,0.00003194069,8.691155e-7,0.00001164358,0.00004595334],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9961799,"threshold_uncertainty_score":0.6162469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0341002519929163,"score_gpt":0.3108631411316437,"score_spread":0.2767628891387274,"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."}}