{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002702145,0.001467947,0.001259887,0.001242134,0.001333387,0.002725662,0.003625601,0.002222394,0.004831193],"category_scores_gemma":[0.01432708,0.0007410036,0.000911795,0.003260789,0.0008872083,0.00399097,0.001748141,0.001657484,0.001355572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002682057,"about_ca_system_score_gemma":0.003283653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007196189,"about_ca_topic_score_gemma":0.008507618,"domain_scores_codex":[0.9974365,0.0006541855,0.0001638111,0.0004641069,0.0007178908,0.0005634411],"domain_scores_gemma":[0.9937553,0.003534238,0.0004611901,0.001300868,0.0007501318,0.0001981859],"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.001187175,0.0007965401,0.00261027,0.0002716084,0.00009284089,0.00009125285,0.0003727588,0.7051436,0.00441377,0.04104488,0.008152114,0.2358232],"study_design_scores_gemma":[0.0001452127,0.00005980035,0.0001646818,0.00001426442,0.00001938717,0.00004760353,0.00006645405,0.9724087,0.002100163,0.02316676,0.00179629,0.00001064548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1172153,0.0008524082,0.8632401,0.0007505214,0.0001335124,0.0002695599,0.0003419328,0.005477558,0.01171899],"genre_scores_gemma":[0.3799961,0.000388587,0.615764,0.000205464,0.00004348733,0.0002918755,0.0009040355,0.0003385289,0.002067873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007196189,"threshold_uncertainty_score":0.01945978,"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."}}