{"id":"W2131242765","doi":"10.1145/1064546.1180614","title":"Implementing approximation algorithms for the single-source unsplittable flow problem","year":2005,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Approximation algorithm; Heuristics; Minimum-cost flow problem; Algorithm; Mathematics; Vertex (graph theory); Multi-commodity flow problem; Flow (mathematics); Computer science; Flow network; Enhanced Data Rates for GSM Evolution; Path (computing); Mathematical optimization; Graph; Combinatorics","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.001385426,0.0002739959,0.000323134,0.0001737723,0.0007114047,0.0004479111,0.002379392,0.00006215118,0.000024697],"category_scores_gemma":[0.00008393161,0.0002077677,0.0003280064,0.0004312352,0.0001039303,0.001356789,0.0007683491,0.0003025233,0.000005979137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002104972,"about_ca_system_score_gemma":0.00008576299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001377235,"about_ca_topic_score_gemma":0.000003675608,"domain_scores_codex":[0.9974276,0.00006756312,0.0008958103,0.0003224308,0.0006211237,0.0006655104],"domain_scores_gemma":[0.9977416,0.0004571208,0.0006639545,0.0006712321,0.0003215045,0.0001445528],"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.00002823077,0.0005190093,0.00002238948,0.00001430685,0.0001489545,0.000005197658,0.002427151,0.002273066,0.007960066,0.007354893,0.001666949,0.9775798],"study_design_scores_gemma":[0.001653595,0.0005705261,0.00002546304,0.00005703124,0.00003992961,0.0004387604,0.001014506,0.8047073,0.08219694,0.007336135,0.1015927,0.000367023],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002340288,0.003004139,0.9908985,0.002303532,0.0006947176,0.00046149,0.0000101629,0.00006612655,0.0002209695],"genre_scores_gemma":[0.0323243,0.00005470392,0.9657568,0.0004167575,0.001252635,0.00003882059,0.000005834788,0.00002840089,0.000121734],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9772128,"threshold_uncertainty_score":0.847252,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04379081623079347,"score_gpt":0.2955807081901236,"score_spread":0.2517898919593301,"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."}}