{"id":"W1984586534","doi":"10.1007/s002360000042","title":"The class Steiner minimal tree problem: a lower bound and test problem generation","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Steiner tree problem; Mathematics; Upper and lower bounds; Linear programming relaxation; Theory of computation; Subgradient method; k-minimum spanning tree; Combinatorics; Discrete mathematics; Approximation algorithm; Time complexity; Integer programming; Tree (set theory); Heuristic; K-ary tree; Mathematical optimization; Algorithm; Binary tree; Tree structure","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.003278365,0.001964836,0.002261898,0.00332399,0.001760514,0.004355611,0.004013218,0.003225619,0.01388848],"category_scores_gemma":[0.02314342,0.0009328249,0.002620809,0.004267665,0.00201811,0.006714938,0.003138945,0.003879281,0.001316453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003144502,"about_ca_system_score_gemma":0.002536232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002555561,"about_ca_topic_score_gemma":0.003686264,"domain_scores_codex":[0.9965019,0.001060705,0.0001622508,0.0005366608,0.001239178,0.0004993759],"domain_scores_gemma":[0.9751152,0.02082636,0.0008633361,0.001490046,0.001052162,0.0006529058],"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.001363629,0.0006716929,0.003033897,0.001366073,0.0002563641,0.000369598,0.0003509781,0.4215618,0.006524265,0.2455442,0.06235039,0.2566072],"study_design_scores_gemma":[0.0001376137,0.0001708349,0.0005455245,0.00009814512,0.0001031674,0.0002973482,0.0001019711,0.79943,0.002726862,0.1915105,0.004850097,0.00002786916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06536133,0.002295841,0.8921192,0.005610892,0.0002974578,0.0005216671,0.002030274,0.001287908,0.03047528],"genre_scores_gemma":[0.49735,0.002429329,0.4740975,0.001307771,0.001069847,0.0009995583,0.006337905,0.001353112,0.01505489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01388848,"threshold_uncertainty_score":0.04646158,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007904042051019923,"score_gpt":0.1912008434298315,"score_spread":0.1832968013788116,"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."}}