{"id":"W2075766499","doi":"10.1016/j.endm.2004.03.039","title":"Minimum-Cost Single-Source 2-Splittable Flow","year":2004,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Minimum-cost flow problem; Mathematical optimization; Mathematics; Flow (mathematics); Vertex (graph theory); Path (computing); Constraint (computer-aided design); Flow network; Enhanced Data Rates for GSM Evolution; Budget constraint; Graph; Computer science; Combinatorics; Economics; Microeconomics; Computer network; Geometry","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.0007734689,0.001518036,0.001641649,0.001381506,0.001243734,0.002057011,0.002593223,0.002299798,0.02267118],"category_scores_gemma":[0.003000749,0.0006790616,0.0009849233,0.001879989,0.0007467446,0.004430815,0.00216284,0.00159123,0.001514845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001503148,"about_ca_system_score_gemma":0.001712431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00171112,"about_ca_topic_score_gemma":0.002904148,"domain_scores_codex":[0.9995494,0.00008307435,0.00002776501,0.0001178249,0.000101462,0.0001203045],"domain_scores_gemma":[0.9985594,0.0006470966,0.0001531645,0.0002486036,0.0001924509,0.0001991949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003581682,0.000836015,0.002008009,0.002588389,0.0003633819,0.0008282941,0.0006594976,0.3160913,0.03516265,0.3376175,0.06581984,0.2344435],"study_design_scores_gemma":[0.000659848,0.0003316451,0.00150412,0.0001523432,0.0001960504,0.0004553129,0.0002503937,0.5329261,0.01184507,0.4410241,0.01057376,0.00008133206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3959176,0.001090074,0.5180427,0.003589085,0.0005486385,0.000787341,0.008231606,0.002355946,0.06943704],"genre_scores_gemma":[0.7537428,0.0007741058,0.2154909,0.000420753,0.0001757354,0.0004060264,0.004019746,0.0004421931,0.02452771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02267118,"threshold_uncertainty_score":0.07584268,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01972464748282074,"score_gpt":0.2491237440068524,"score_spread":0.2293990965240317,"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."}}