{"id":"W2950683345","doi":"10.1007/978-3-642-32512-0_10","title":"Approximating Minimum-Cost Connected T-Joins","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Approximation algorithm; Combinatorics; Rounding; Steiner tree problem; Degree (music); Undirected graph; Mathematics; Discrete mathematics; Graph; Connected dominating set; Computer science; Physics","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.001185861,0.001412363,0.002001386,0.001531174,0.0009300839,0.002803617,0.003351032,0.002049614,0.01589256],"category_scores_gemma":[0.01151325,0.0007802976,0.001131357,0.003701616,0.0009981594,0.004371035,0.003116122,0.002721705,0.002541862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001529504,"about_ca_system_score_gemma":0.00109357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001009683,"about_ca_topic_score_gemma":0.002204251,"domain_scores_codex":[0.9987732,0.0002378223,0.00006409195,0.0002615027,0.0004744592,0.0001890269],"domain_scores_gemma":[0.9936329,0.004133713,0.0003605373,0.0008666317,0.0004797913,0.0005264127],"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.002089741,0.0006489905,0.002683613,0.001149922,0.0001393613,0.0003877514,0.0005273634,0.4493963,0.01394472,0.1869928,0.03381641,0.3082231],"study_design_scores_gemma":[0.0001954683,0.000219439,0.0003965631,0.0000724707,0.00006784737,0.0003173872,0.0002348029,0.7834817,0.004175718,0.2053982,0.005421855,0.00001859353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2757477,0.001810504,0.6784393,0.001939163,0.0003600006,0.0003517743,0.002018115,0.002717334,0.03661614],"genre_scores_gemma":[0.508815,0.001034618,0.4711877,0.0003195641,0.0003057598,0.0003396719,0.003368791,0.000869075,0.01375981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01589256,"threshold_uncertainty_score":0.05316591,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03168321393909158,"score_gpt":0.252427819317922,"score_spread":0.2207446053788304,"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."}}