{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00206716,0.001470247,0.001332528,0.00127721,0.0009091361,0.002362593,0.001095304,0.001908835,0.004631894],"category_scores_gemma":[0.005707904,0.001091784,0.001544546,0.003082086,0.001408924,0.004302402,0.00151289,0.002947728,0.0004019325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002344752,"about_ca_system_score_gemma":0.001042649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002931808,"about_ca_topic_score_gemma":0.002253304,"domain_scores_codex":[0.9989148,0.0003904562,0.00004591457,0.0001933433,0.0002270586,0.0002283684],"domain_scores_gemma":[0.9974611,0.001925702,0.0002632138,0.00009679993,0.0001426324,0.000110399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001565508,0.000206278,0.0006836905,0.0002711365,0.00005684788,0.0002175137,0.0003133622,0.7075287,0.001415463,0.2662064,0.003420002,0.01952408],"study_design_scores_gemma":[0.00002206458,0.00003667954,0.000165619,0.00002134383,0.00001376224,0.00006202758,0.00005200799,0.9121754,0.0004908899,0.08458865,0.00236119,0.00001039599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09932126,0.002407195,0.8663508,0.001858963,0.0001526905,0.0001517666,0.0004780824,0.0003299698,0.02894929],"genre_scores_gemma":[0.5960359,0.002377514,0.388135,0.0006890778,0.0003373245,0.0004462116,0.0006615418,0.0002517398,0.01106563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004631894,"threshold_uncertainty_score":0.01701248,"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."}}