{"id":"W2071642760","doi":"10.1007/s101070100253","title":"A faster capacity scaling algorithm for minimum cost submodular flow","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Minimum-cost flow problem; Maximum flow problem; Scaling; Dijkstra's algorithm; Shortest path problem; Mathematical optimization; Approximation algorithm; Suurballe's algorithm; Flow (mathematics); Flow network; Algorithm; 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.002170953,0.002172701,0.002355458,0.001944349,0.001324564,0.002443451,0.003217972,0.00197333,0.02052383],"category_scores_gemma":[0.008947925,0.0009759059,0.001299778,0.003220973,0.001051679,0.005965597,0.00340173,0.004015889,0.002970997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002299878,"about_ca_system_score_gemma":0.003416196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004859442,"about_ca_topic_score_gemma":0.004969108,"domain_scores_codex":[0.9983239,0.0003973783,0.00008393669,0.0003875917,0.0005398274,0.0002674559],"domain_scores_gemma":[0.9964455,0.001682441,0.0002020986,0.0008679359,0.0005514796,0.0002505507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007248259,0.0007427308,0.0006813339,0.0005365135,0.00009192531,0.0001151996,0.0002748351,0.2408459,0.01125072,0.09402691,0.05004032,0.6006687],"study_design_scores_gemma":[0.0002002284,0.0001104529,0.0001901401,0.00003386642,0.00002903077,0.00007828744,0.00005604537,0.9109269,0.002970575,0.07898746,0.006390208,0.00002670731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03223914,0.000910536,0.9387532,0.001909109,0.0005897815,0.000483039,0.00050031,0.004848462,0.01976635],"genre_scores_gemma":[0.184045,0.000378025,0.8045894,0.0006440558,0.0003618858,0.0007324978,0.0008607991,0.0009342201,0.007454069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02052383,"threshold_uncertainty_score":0.06865913,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0668083390083673,"score_gpt":0.2628127092700038,"score_spread":0.1960043702616365,"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."}}