{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002110669,0.0002455548,0.0002261678,0.0002433786,0.0009310372,0.0001041785,0.0009308822,0.0001257916,0.00007264115],"category_scores_gemma":[0.00004065672,0.0002435027,0.0002447859,0.0004559227,0.000130385,0.0009133316,0.0000249062,0.0003360181,0.00007228446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007276419,"about_ca_system_score_gemma":0.00007503731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002522875,"about_ca_topic_score_gemma":0.00001001916,"domain_scores_codex":[0.9982343,0.00005308317,0.0003381735,0.0005632106,0.0004395169,0.0003717493],"domain_scores_gemma":[0.9983252,0.0003520867,0.00009576539,0.0009077545,0.0001900041,0.0001292062],"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.00003499877,0.001222675,0.00003131268,0.00005804034,0.0001280906,0.000006643192,0.001068328,0.01304607,0.0002318504,0.004023817,0.0006103008,0.9795378],"study_design_scores_gemma":[0.001197206,0.0002062799,0.0004206264,0.00002667481,0.00001541013,0.00009806198,0.00002329364,0.952027,0.003679164,0.02198182,0.01994409,0.0003803408],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007411924,0.00003693163,0.9953984,0.001692955,0.0009318265,0.000581712,0.00007408127,0.0003730425,0.0001698774],"genre_scores_gemma":[0.0805874,0.00003813702,0.9180632,0.0003408534,0.0001577446,0.0003856645,0.00002564167,0.00002179541,0.0003795619],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9791575,"threshold_uncertainty_score":0.9929754,"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."}}