{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00158859,0.0012972,0.001952541,0.001774581,0.00126777,0.003798104,0.003574751,0.002519757,0.01278545],"category_scores_gemma":[0.01768603,0.0007972737,0.001227451,0.003754242,0.001272207,0.006440646,0.003101462,0.002848898,0.001631071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001833199,"about_ca_system_score_gemma":0.001666518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00140071,"about_ca_topic_score_gemma":0.003107156,"domain_scores_codex":[0.9984376,0.0003625363,0.00008909382,0.0003700578,0.0005029893,0.0002377283],"domain_scores_gemma":[0.9864503,0.009774302,0.0007865509,0.00136784,0.0007968022,0.0008242708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002296451,0.0008047623,0.005877136,0.001073173,0.0001653835,0.000381389,0.0007359182,0.5406497,0.01035914,0.2151355,0.02274797,0.1997735],"study_design_scores_gemma":[0.0001713681,0.0001577238,0.0004639918,0.00005068353,0.00006887893,0.0002083468,0.0002538579,0.7710604,0.002989858,0.2217394,0.002819613,0.0000159523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4011061,0.001647067,0.5675992,0.002723355,0.0002486478,0.0003031328,0.001778152,0.001603782,0.0229906],"genre_scores_gemma":[0.6843985,0.0008322417,0.3025637,0.0003105287,0.0002671911,0.0002533632,0.002560587,0.0004805208,0.008333433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01278545,"threshold_uncertainty_score":0.04277152,"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."}}