{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001641804,0.0001128366,0.0001361787,0.0001027328,0.0002461163,0.00007039283,0.0005578473,0.00004437439,0.00003848553],"category_scores_gemma":[0.00003665153,0.0001000463,0.0001061944,0.0002670955,0.00005964498,0.0004545158,0.0001494551,0.00005757351,0.00010445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001808639,"about_ca_system_score_gemma":0.00004435886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002561251,"about_ca_topic_score_gemma":0.000008727331,"domain_scores_codex":[0.9990793,0.00001698177,0.0001933017,0.0002934039,0.0001685495,0.0002484507],"domain_scores_gemma":[0.9992897,0.00009759139,0.00005489158,0.0004095896,0.00007498605,0.00007325216],"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.00006606199,0.0006727858,0.002733535,0.00009567108,0.0001172876,0.00002847771,0.001985564,0.0003069346,0.009066662,0.5342843,0.3522079,0.09843478],"study_design_scores_gemma":[0.0008429908,0.0001517213,0.001767778,0.000009839031,0.000003304269,0.000055932,0.00001024179,0.9430813,0.00255776,0.008644697,0.04257046,0.0003039478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02933363,0.00002525,0.9604824,0.001067404,0.0001933103,0.0003366711,0.000003743142,0.0003277511,0.008229913],"genre_scores_gemma":[0.1286779,0.000003983553,0.8643501,0.0004699521,0.0001983231,0.00005560896,0.0000122387,0.00001162411,0.006220215],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9427744,"threshold_uncertainty_score":0.4079771,"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."}}