{"id":"W2096411231","doi":"10.1007/s10107-005-0668-2","title":"Optimal 3-terminal cuts and linear programming","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Mathematics; Minimum weight; Linear programming relaxation; Linear programming; Terminal (telecommunication); Combinatorics; Maximum cut; Minimum cut; Relaxation (psychology); Approximation algorithm; Mathematical optimization; Undirected graph; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Computer science","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.001802906,0.001154033,0.001469144,0.001466227,0.001365693,0.005148279,0.002203279,0.002324442,0.01234921],"category_scores_gemma":[0.01167,0.00115999,0.001372437,0.002832178,0.002911681,0.007215545,0.002095815,0.006916744,0.001332771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003109184,"about_ca_system_score_gemma":0.001446061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002534921,"about_ca_topic_score_gemma":0.003031821,"domain_scores_codex":[0.9984329,0.0006241502,0.00005197238,0.0002698317,0.0003782772,0.0002428315],"domain_scores_gemma":[0.9937848,0.004876372,0.0004235207,0.0003328014,0.0003158695,0.0002667186],"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.0001219838,0.0001031276,0.0002770551,0.0001548621,0.0000256923,0.00004621122,0.0001425453,0.07931405,0.0006733469,0.8868347,0.007466631,0.02483988],"study_design_scores_gemma":[0.00001553752,0.00001002738,0.00009315386,0.00002265582,0.000006495083,0.0000221163,0.00002876013,0.08513223,0.0002227202,0.912868,0.001570402,0.000007910409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06400239,0.001794872,0.8764941,0.00367561,0.0002606484,0.0001032777,0.0004484006,0.0003494169,0.0528713],"genre_scores_gemma":[0.5128234,0.002665981,0.4438509,0.001245422,0.0006605244,0.0004197136,0.001373808,0.0005151873,0.03644504],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01234921,"threshold_uncertainty_score":0.04131228,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02734908984770169,"score_gpt":0.2849792314044849,"score_spread":0.2576301415567833,"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."}}