{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002837859,0.001507418,0.002104799,0.001095274,0.0009169897,0.001826876,0.002518049,0.001503093,0.003809268],"category_scores_gemma":[0.01170962,0.0008173664,0.00176645,0.001860553,0.001203391,0.002637625,0.002316183,0.003284559,0.001119094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0017985,"about_ca_system_score_gemma":0.00233835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002809953,"about_ca_topic_score_gemma":0.00281278,"domain_scores_codex":[0.9959338,0.001610978,0.0002005935,0.000608566,0.001005488,0.0006405159],"domain_scores_gemma":[0.9933723,0.004305067,0.0005126798,0.001167235,0.0004854154,0.000157303],"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.0007310292,0.0003268339,0.001066172,0.0002780743,0.0001363334,0.0002244791,0.0001977635,0.8105972,0.006636602,0.06754618,0.009339406,0.1029198],"study_design_scores_gemma":[0.00007794381,0.00005162478,0.00008015446,0.00001520301,0.00002063945,0.00004844226,0.00002324035,0.972343,0.001082324,0.02526216,0.0009857269,0.00000955365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0282081,0.0004675903,0.9619129,0.0005607992,0.00009299698,0.0001616794,0.0001796779,0.001669955,0.006746237],"genre_scores_gemma":[0.3496252,0.0004038781,0.6454604,0.0004008299,0.0001232488,0.0005189707,0.0005467247,0.0003293334,0.002591488],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003809268,"threshold_uncertainty_score":0.01500815,"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."}}