{"id":"W1976584101","doi":"10.1145/2432622.2432628","title":"Steiner Tree Approximation via Iterative Randomized Rounding","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":280,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; European Research Council; Division of Computing and Communication Foundations; Alexander von Humboldt-Stiftung; Ministerstwo Edukacji i Nauki; Fundacja na rzecz Nauki Polskiej; École Polytechnique Fédérale de Lausanne","keywords":"Steiner tree problem; Rounding; Mathematics; Combinatorics; Linear programming relaxation; Approximation algorithm; Randomized rounding; Tree (set theory); Sequence (biology); k-minimum spanning tree; Relaxation (psychology); Discrete mathematics; Minimum spanning tree; Iterative method; Mathematical optimization; Tree structure; K-ary tree; Computer science; Linear programming; Binary tree","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.0008552676,0.00007714068,0.0002413067,0.00009078709,0.0001264342,0.0002647497,0.002272824,0.00002433229,0.00002674883],"category_scores_gemma":[0.0007493601,0.0000405387,0.0002449658,0.0002337111,0.00005706665,0.000978619,0.0005068376,0.0001904717,0.00001424801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000369657,"about_ca_system_score_gemma":0.00002541047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001121029,"about_ca_topic_score_gemma":0.000001442388,"domain_scores_codex":[0.9989119,0.0002526517,0.0003451133,0.00007721304,0.0003002092,0.0001128691],"domain_scores_gemma":[0.998292,0.0004261185,0.0004243063,0.0006329257,0.0001818218,0.00004278783],"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.003056344,0.0007519087,0.0009667171,0.00008483158,0.001140727,0.00003747071,0.02403723,0.001981576,0.03161206,0.2380371,0.04390084,0.6543933],"study_design_scores_gemma":[0.02075386,0.00006653215,0.001394195,0.00009009647,0.00002788249,0.0001840824,0.00005825272,0.1912337,0.002881408,0.7826443,0.0005344231,0.0001313323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0793126,0.0001603008,0.905296,0.01250324,0.001381807,0.0002699126,1.8943e-7,0.00001749785,0.001058417],"genre_scores_gemma":[0.7514967,0.00001062635,0.2472713,0.0004447531,0.0003059731,0.000007410525,1.002266e-7,0.000004994547,0.0004580977],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6721841,"threshold_uncertainty_score":0.422351,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01898129140375479,"score_gpt":0.2430249264847187,"score_spread":0.2240436350809639,"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."}}