{"id":"W2168958045","doi":"10.1109/focs.2008.59","title":"A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest","year":2008,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polynomial-time approximation scheme; Scheme (mathematics); Euclidean geometry; Approximation algorithm; Combinatorics; Euclidean distance; Plane (geometry); Time complexity; Steiner tree problem; Mathematics; Polynomial; Binary logarithm; Running time; Discrete mathematics; Mathematical optimization; Mathematical analysis; Geometry","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.001856616,0.001326188,0.00175051,0.001255669,0.00136813,0.002485584,0.005094436,0.001959338,0.01107614],"category_scores_gemma":[0.006220473,0.0007700546,0.001600561,0.003745285,0.001036415,0.007198813,0.003535053,0.002482123,0.003448432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004015774,"about_ca_system_score_gemma":0.003321095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006375793,"about_ca_topic_score_gemma":0.006608102,"domain_scores_codex":[0.9963039,0.0006727635,0.0002769572,0.0009679252,0.0009334676,0.0008449269],"domain_scores_gemma":[0.9969016,0.001002146,0.0002898891,0.001332114,0.0002652392,0.0002089837],"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.003427768,0.0007100882,0.002186195,0.001146864,0.0003131597,0.000295794,0.000640816,0.2574186,0.03115412,0.1410964,0.06064111,0.5009691],"study_design_scores_gemma":[0.0007709689,0.0004688277,0.001146595,0.00007523051,0.0001855154,0.000736589,0.0002254034,0.8512606,0.01435823,0.1103806,0.02027288,0.0001185869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07492656,0.001937379,0.8963634,0.001586137,0.000235708,0.0003799933,0.002399384,0.008679499,0.01349187],"genre_scores_gemma":[0.3655857,0.0007889184,0.6217462,0.0004471166,0.0001183929,0.0003511573,0.00410838,0.000450316,0.006403929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01107614,"threshold_uncertainty_score":0.03705341,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02965295037859593,"score_gpt":0.2329493240795324,"score_spread":0.2032963737009365,"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."}}