{"id":"W1965608008","doi":"10.1007/s00453-013-9850-8","title":"Approximating Minimum-Cost Connected T-Joins","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Approximation algorithm; Combinatorics; Mathematics; Rounding; Degree (music); Steiner tree problem; Discrete mathematics; Theory of computation; Path (computing); Undirected graph; Graph; 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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002138466,0.0002337642,0.0002643468,0.0001634658,0.0002926987,0.00040226,0.001316617,0.00009121894,0.0002589662],"category_scores_gemma":[0.0001028535,0.0002222358,0.0001225743,0.0007444171,0.0001094262,0.0007833097,0.0004537636,0.0002643408,0.000931711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003580475,"about_ca_system_score_gemma":0.00005458824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001512751,"about_ca_topic_score_gemma":0.000004664262,"domain_scores_codex":[0.9980525,0.00007836832,0.0004027197,0.0005568707,0.0003378734,0.0005716453],"domain_scores_gemma":[0.9984235,0.0002461994,0.0001331943,0.0008253038,0.000169681,0.0002021885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001706408,0.0002134158,0.0001060839,0.00002724863,0.00006408666,0.00002613094,0.0009728422,0.00001899616,0.002153015,0.113152,0.01098242,0.872282],"study_design_scores_gemma":[0.0007219336,0.0001089476,0.002013827,0.00004252116,0.000009389864,0.0000938696,0.0001432991,0.9031746,0.005000137,0.07453882,0.01350263,0.0006500063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01567257,0.0001059308,0.9676914,0.00261941,0.0008421583,0.0007758992,0.000009224957,0.0008729012,0.01141057],"genre_scores_gemma":[0.2766063,0.000007686321,0.7209966,0.001175505,0.0003246374,0.0002335737,0.00001714002,0.00002913641,0.0006094255],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9031556,"threshold_uncertainty_score":0.9998462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01753872424757054,"score_gpt":0.228435478181481,"score_spread":0.2108967539339104,"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."}}