{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007759192,0.001586309,0.001888159,0.001683009,0.00080274,0.003045578,0.002679683,0.001491721,0.02321405],"category_scores_gemma":[0.006151712,0.001102898,0.001273691,0.004128687,0.001043019,0.004272827,0.002894304,0.002796028,0.004220094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002041896,"about_ca_system_score_gemma":0.0008391524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001720406,"about_ca_topic_score_gemma":0.003396635,"domain_scores_codex":[0.9988813,0.0002079478,0.00006131444,0.0002490046,0.0004259997,0.0001743765],"domain_scores_gemma":[0.9975173,0.001093229,0.0002070346,0.0006631587,0.0003172141,0.0002020455],"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.001039035,0.0003475246,0.00296399,0.0009963519,0.0002064668,0.0003527032,0.0004744498,0.2709857,0.01136607,0.3097518,0.04298609,0.3585298],"study_design_scores_gemma":[0.0001171857,0.0001533842,0.001126063,0.0001141695,0.0001024061,0.0006286925,0.0002977685,0.5928226,0.004835072,0.3843206,0.01545073,0.00003130599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2461066,0.002103298,0.6192592,0.001399099,0.0004383424,0.0002877943,0.002027349,0.00249652,0.1258819],"genre_scores_gemma":[0.4954385,0.001650074,0.4580839,0.0002942106,0.0002045894,0.0002612352,0.004504153,0.0009827917,0.03858056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02321405,"threshold_uncertainty_score":0.07765871,"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."}}