{"id":"W1536432301","doi":"10.1007/s00453-001-0050-6","title":"Grade of Service Steiner Minimum Trees in the Euclidean Plane","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Euclidean geometry; Euclidean distance; Approximation algorithm; Generalization; Path (computing); Spanning tree; Terminal (telecommunication); Discrete mathematics; Point (geometry); 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.0003039626,0.0003446478,0.0005918615,0.0007661723,0.0004324898,0.001611694,0.0006816816,0.0006205009,0.004189065],"category_scores_gemma":[0.001921184,0.0002452717,0.0002600188,0.001360803,0.0003360156,0.00173389,0.0006347821,0.0005645929,0.0008838325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008090393,"about_ca_system_score_gemma":0.0005277465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001179267,"about_ca_topic_score_gemma":0.002665211,"domain_scores_codex":[0.999694,0.00007640658,0.00002571347,0.00003565232,0.0001096669,0.00005859973],"domain_scores_gemma":[0.9994481,0.0001880725,0.0001185876,0.00007867502,0.0001164668,0.00005003479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001114008,0.0001177535,0.004103494,0.0003978766,0.00006355949,0.0003534026,0.0004006719,0.2156757,0.01547697,0.5166814,0.01289667,0.2327184],"study_design_scores_gemma":[0.0001377968,0.0004015846,0.002970539,0.00007328318,0.00006480127,0.0007457443,0.0004630067,0.4769837,0.01102699,0.4855536,0.02154193,0.00003702374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4807602,0.001053281,0.481023,0.001025157,0.00007990139,0.00008147825,0.0009089984,0.0005927394,0.03447521],"genre_scores_gemma":[0.8571574,0.0009312281,0.1298906,0.00008067697,0.00003778492,0.000046325,0.0007254795,0.0001372638,0.0109932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004189065,"threshold_uncertainty_score":0.01401383,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0152213491867486,"score_gpt":0.2221644785660194,"score_spread":0.2069431293792708,"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."}}