{"id":"W2020899710","doi":"10.1145/1328911.1328924","title":"Faster approximation schemes for fractional multicommodity flow problems","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Multi-commodity flow problem; Flow (mathematics); Fleischer; Representation (politics); Combinatorics; Upper and lower bounds; Flow network; Time complexity; Discrete mathematics; Tree (set theory); Maximum flow problem; Theory of computation; Approximation algorithm; 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.002536275,0.00139387,0.001271517,0.001048823,0.001070658,0.002049831,0.002891871,0.001769711,0.005716364],"category_scores_gemma":[0.01089837,0.0005808616,0.001632078,0.001458638,0.001189278,0.005388995,0.002669308,0.003050424,0.001228765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002601425,"about_ca_system_score_gemma":0.001406641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00475008,"about_ca_topic_score_gemma":0.004492473,"domain_scores_codex":[0.997915,0.0004500316,0.0001205052,0.0003206884,0.000827963,0.0003658358],"domain_scores_gemma":[0.995764,0.002067747,0.0002601767,0.001303818,0.0004523342,0.0001517918],"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.0007155525,0.0002766789,0.00123646,0.0003973109,0.00008926958,0.0001213874,0.000633479,0.5459632,0.009195814,0.16565,0.007036095,0.2686847],"study_design_scores_gemma":[0.00006167623,0.00004319827,0.000105065,0.00002596717,0.00001507954,0.00004140703,0.00003247724,0.9361392,0.001547322,0.05850523,0.003468619,0.00001481831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01823869,0.000581936,0.9753003,0.0003343918,0.00009730527,0.00009308774,0.00009838394,0.00104623,0.00420974],"genre_scores_gemma":[0.278949,0.0004057135,0.7152773,0.0002248925,0.0001136423,0.0002753055,0.0003748027,0.0003509892,0.004028322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005716364,"threshold_uncertainty_score":0.01912314,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06449367461059989,"score_gpt":0.2738331663970109,"score_spread":0.209339491786411,"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."}}