{"id":"W4386828169","doi":"10.1007/s11590-023-02058-w","title":"Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Line (geometry); Constant (computer programming); Approximation algorithm; Line segment; Discrete mathematics; Euclidean geometry; Point (geometry); Tree (set theory); Computer science; 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.0005639462,0.0009713863,0.001229736,0.001075373,0.0006137184,0.001113191,0.001784308,0.00148508,0.008419405],"category_scores_gemma":[0.0024832,0.000535742,0.0007657883,0.002169139,0.00037673,0.001806854,0.001067689,0.001392894,0.001301829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001207535,"about_ca_system_score_gemma":0.001540593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003813242,"about_ca_topic_score_gemma":0.005707419,"domain_scores_codex":[0.9994422,0.0001427,0.00002838349,0.00009188247,0.0001719112,0.0001229065],"domain_scores_gemma":[0.9992369,0.0004181983,0.00008892592,0.0001007084,0.0001106042,0.00004452234],"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.0006134434,0.0003027773,0.001066636,0.0003424281,0.00009261574,0.0001590559,0.0001826362,0.6753863,0.006123317,0.02714482,0.01507622,0.2735098],"study_design_scores_gemma":[0.00008795659,0.00009059489,0.0001999251,0.00001915341,0.00002022643,0.00009667966,0.00004926963,0.9864201,0.0009400418,0.01021936,0.001847509,0.000009211712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02898165,0.0005097138,0.9608592,0.0004536195,0.00008994957,0.00009782649,0.0002929047,0.001121759,0.007593406],"genre_scores_gemma":[0.2241326,0.0003791097,0.7699125,0.0001788221,0.00006385671,0.0002412411,0.0009100236,0.0001612609,0.004020619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008419405,"threshold_uncertainty_score":0.0281657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01001307811278146,"score_gpt":0.2182646166167986,"score_spread":0.2082515385040171,"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."}}