{"id":"W2047041799","doi":"10.1007/s10898-005-4207-8","title":"Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Upper and lower bounds; Combinatorics; Conjecture; Euclidean space; Euclidean geometry; Tree (set theory); Discrete mathematics; Space (punctuation); Topology (electrical circuits); Mathematical analysis; Geometry; Computer science","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.003594622,0.0018527,0.001782547,0.0028344,0.0009182775,0.003750167,0.00324382,0.002264998,0.008558893],"category_scores_gemma":[0.03421967,0.001187723,0.00145923,0.002916861,0.001857192,0.005967122,0.002962365,0.004462625,0.001692377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003546301,"about_ca_system_score_gemma":0.001649957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001611967,"about_ca_topic_score_gemma":0.004552281,"domain_scores_codex":[0.9970386,0.0009336972,0.000144262,0.000388896,0.001097998,0.0003964939],"domain_scores_gemma":[0.9776174,0.01742121,0.001070648,0.001997189,0.001322984,0.0005704752],"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.001478447,0.0002352604,0.003308641,0.0007627212,0.0001792494,0.0001775356,0.000443877,0.7008406,0.008057522,0.1461749,0.012828,0.1255132],"study_design_scores_gemma":[0.00004837216,0.000113285,0.0007111247,0.0001315438,0.0000589123,0.0001246272,0.0001120253,0.8862791,0.002136268,0.1069155,0.003340472,0.00002865267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1184457,0.008143954,0.841276,0.00291037,0.0004182555,0.0001325069,0.001189902,0.00113247,0.02635087],"genre_scores_gemma":[0.5430486,0.00463685,0.4389818,0.0006096989,0.0006240265,0.0003375071,0.00213962,0.0007958486,0.008826029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008558893,"threshold_uncertainty_score":0.02863234,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00582047564380004,"score_gpt":0.2107929045233077,"score_spread":0.2049724288795077,"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."}}