{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001909487,0.0001319643,0.0001377095,0.00008885701,0.0000554327,0.00003259591,0.0001108912,0.00005233521,0.00002444819],"category_scores_gemma":[0.00001105637,0.0000943978,0.00004293333,0.0003708174,0.00003196127,0.0001838851,0.00001402388,0.00006356356,0.00000649018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002523204,"about_ca_system_score_gemma":0.000006739599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003288175,"about_ca_topic_score_gemma":0.000001214528,"domain_scores_codex":[0.9992877,0.00001536145,0.0002304963,0.0001323326,0.0001529204,0.0001811785],"domain_scores_gemma":[0.999583,0.00007925706,0.0000676776,0.0001736432,0.00007326307,0.00002315269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008950278,0.00001384858,0.0000778165,0.0001043949,0.00005587465,0.000001035405,0.000381493,0.9594408,0.007830255,0.00008698479,0.01321476,0.01878378],"study_design_scores_gemma":[0.0004003017,0.00003025728,0.00002424032,0.00004758315,0.00002527134,0.00000313159,0.00005479417,0.9909074,0.007986117,0.00003476034,0.0003506655,0.000135498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003611537,0.000008017506,0.9938135,0.000976509,0.00005107688,0.0005948229,0.00001725777,0.0004923068,0.0004349392],"genre_scores_gemma":[0.06283027,0.00003344103,0.9353449,0.0004044135,0.0001569085,0.0004098564,0.0002818085,0.0001153117,0.0004230538],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05921873,"threshold_uncertainty_score":0.3849431,"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."}}