{"id":"W2177638926","doi":"10.5555/2095116.2095235","title":"Approximating rooted Steiner networks","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Generalization; Linear programming relaxation; Undirected graph; Mathematics; Approximation algorithm; Discrete mathematics; Linear programming; Focus (optics); Relaxation (psychology); Computer science; Mathematical optimization; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007471137,0.0003993743,0.0003601619,0.0001987421,0.0004093542,0.0002995592,0.001318588,0.0001563034,0.00004054367],"category_scores_gemma":[0.00003261932,0.0003470768,0.0002221379,0.0008615116,0.0001128168,0.00108158,0.0005503097,0.0004697356,0.0001421709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007073064,"about_ca_system_score_gemma":0.00002858514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003085508,"about_ca_topic_score_gemma":0.000001751549,"domain_scores_codex":[0.9969958,0.000169889,0.0004954635,0.0006175496,0.0006006275,0.001120679],"domain_scores_gemma":[0.9979985,0.0001870098,0.0001978592,0.001151921,0.00007605001,0.0003886669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005630689,0.001213324,0.003023449,0.0001085291,0.0003631088,0.00006735515,0.004121207,0.01505253,0.002217643,0.6228827,0.007127437,0.3437665],"study_design_scores_gemma":[0.0006964356,0.0002505582,0.0019599,0.00008608544,0.00002298962,0.00005705482,0.00006817582,0.9797342,0.001669646,0.002868376,0.01172891,0.0008576547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002322627,0.000600891,0.9730944,0.001374168,0.002465477,0.0003757666,0.00001020175,0.0007070472,0.01904941],"genre_scores_gemma":[0.7546618,0.00007818204,0.2402007,0.001423968,0.002200867,0.000122631,0.00004382005,0.00007989012,0.001188144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9646817,"threshold_uncertainty_score":0.9998981,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01763125246592238,"score_gpt":0.252691496209125,"score_spread":0.2350602437432026,"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."}}