{"id":"W1600160158","doi":"10.1007/3-540-45061-0_17","title":"Approximating Steiner k-Cuts","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Rounding; Steiner tree problem; Linear programming relaxation; Combinatorics; Mathematics; Approximation algorithm; Generalization; Discrete mathematics; Maximum cut; Minimum weight; Relaxation (psychology); Minimum cut; Linear programming; Graph; Computer science; Algorithm","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00122575,0.0006684848,0.0006608849,0.0009825235,0.0004375431,0.0008169404,0.004359354,0.0003382648,0.00004391069],"category_scores_gemma":[0.0001174425,0.000626602,0.0002126249,0.0009853019,0.0008477373,0.0007273955,0.00165217,0.001149174,0.00006646108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002346348,"about_ca_system_score_gemma":0.0003609783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001255069,"about_ca_topic_score_gemma":0.00002617626,"domain_scores_codex":[0.9951467,0.00005079043,0.0007187661,0.001893254,0.001273153,0.0009173607],"domain_scores_gemma":[0.9967843,0.0004337484,0.0003651096,0.001948827,0.0002421323,0.0002259273],"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.0000017096,0.00003670286,0.00001922316,0.00004987416,0.00001402972,0.0001103702,0.0005266658,0.007236174,0.00005537322,0.1675086,0.00009016108,0.8243511],"study_design_scores_gemma":[0.0002429512,0.0001199103,0.00001895626,0.0003414126,0.000006436058,0.0001476681,1.383222e-7,0.4581582,0.0006486471,0.5308659,0.008564622,0.0008850982],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001774011,0.0005365389,0.9747239,0.0007961144,0.002431398,0.0003565634,0.000004145666,0.0002522971,0.02088128],"genre_scores_gemma":[0.005988558,0.00003304508,0.9889861,0.003290967,0.0004666894,0.00001185478,0.00000408498,0.0000475131,0.001171127],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.823466,"threshold_uncertainty_score":0.9996185,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0220167658478086,"score_gpt":0.2398575649057077,"score_spread":0.2178407990578991,"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."}}