{"id":"W2015423869","doi":"10.1007/s10107-009-0299-0","title":"New geometry-inspired relaxations and algorithms for the metric Steiner tree problem","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Bipartite graph; Metric (unit); Linear programming relaxation; Combinatorics; Approximation algorithm; Upper and lower bounds; Algorithm; Relaxation (psychology); Schema (genetic algorithms); Discrete mathematics; Linear programming; Computer science; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.0006629268,0.000174228,0.0002345453,0.0001864178,0.0004080796,0.0004953161,0.0006787137,0.00006548306,0.00001056351],"category_scores_gemma":[0.0003361632,0.0001149312,0.0001261208,0.001288466,0.00006859246,0.0002927478,0.0001460672,0.0001638623,0.00001142044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002152657,"about_ca_system_score_gemma":0.00003431307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008832509,"about_ca_topic_score_gemma":0.000003341791,"domain_scores_codex":[0.9985412,0.00002956672,0.0003454843,0.0003586494,0.0003243565,0.0004007353],"domain_scores_gemma":[0.9982818,0.0008997692,0.0001092884,0.0004817163,0.00007075715,0.0001567159],"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.000001244347,0.00006220272,0.000004806961,0.00002080401,0.00001491053,0.000001038339,0.0002525378,0.000005023618,0.000006896285,0.3130577,0.000262019,0.6863108],"study_design_scores_gemma":[0.000638693,0.0003974843,0.0004745976,0.00005876519,0.00005338056,0.00004310416,0.00007837169,0.2621283,0.0001063191,0.7113431,0.02439145,0.0002865488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001557766,0.0005662378,0.9919166,0.005392131,0.00007257826,0.0008712731,0.000001128684,0.0002575945,0.0007666732],"genre_scores_gemma":[0.02893633,0.000009833669,0.9700671,0.0001818787,0.000116957,0.00008387976,0.000001621005,0.0000101399,0.0005922685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6860242,"threshold_uncertainty_score":0.4776345,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03784171705136553,"score_gpt":0.2851208739396493,"score_spread":0.2472791568882838,"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."}}