{"id":"W4388750673","doi":"10.1145/3610940","title":"Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow","year":2023,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Minimum-cost flow problem; Amortized analysis; Mathematics; Minimum cut; Separable space; Algorithm; Time complexity; Maximum flow problem; Bounded function; Regular polygon; Combinatorics; Directed graph; Discrete mathematics; Mathematical optimization; Computer science; Flow network; Data structure","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.001039706,0.001703065,0.0009422389,0.001376888,0.0008970384,0.00133998,0.002347491,0.001284634,0.008552251],"category_scores_gemma":[0.007211525,0.0007496468,0.001018601,0.002052174,0.0009022335,0.004148727,0.001819441,0.001993864,0.002082046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00212337,"about_ca_system_score_gemma":0.002507943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004494962,"about_ca_topic_score_gemma":0.006762303,"domain_scores_codex":[0.9988171,0.0002618127,0.00008183809,0.0003160387,0.0003402618,0.0001830004],"domain_scores_gemma":[0.9974254,0.001310624,0.0002403851,0.0005919894,0.0003452097,0.00008640841],"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.0004409422,0.0002715027,0.001199689,0.0004100652,0.00008189956,0.0001074336,0.0002056052,0.4400578,0.005867892,0.1024219,0.02166595,0.4272693],"study_design_scores_gemma":[0.0000638083,0.00003400598,0.0001878221,0.00001615329,0.00001242491,0.0000600403,0.00003623333,0.8968284,0.002324303,0.09744128,0.002981167,0.00001436994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009647456,0.0002603265,0.9820737,0.0003354358,0.0000449158,0.0001023384,0.000333966,0.003276299,0.003925614],"genre_scores_gemma":[0.128588,0.0001776324,0.8667542,0.0001435688,0.00007058881,0.0002738093,0.001105482,0.0005484007,0.002338384],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008552251,"threshold_uncertainty_score":0.02861011,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09238388434712162,"score_gpt":0.3403967687830984,"score_spread":0.2480128844359767,"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."}}