{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001567208,0.0001403506,0.000108717,0.00003510507,0.0001517,0.0002411721,0.0001268611,0.00008192207,0.00008892612],"category_scores_gemma":[0.00001752999,0.00009573877,0.00002705916,0.00009230849,0.00005376488,0.0005356526,0.00001716446,0.0001324069,0.00006515961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002716335,"about_ca_system_score_gemma":0.00001484281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003706632,"about_ca_topic_score_gemma":0.00001944377,"domain_scores_codex":[0.99924,0.000008122824,0.0003140474,0.0000667221,0.0001321091,0.000238965],"domain_scores_gemma":[0.9996155,0.00008816999,0.00002841329,0.0001862776,0.00002495587,0.00005670427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003511489,0.00009260212,0.0002452353,0.0003872484,0.0001216195,0.00000666305,0.004076261,0.0002358186,0.02821869,0.003501507,0.2336052,0.729474],"study_design_scores_gemma":[0.0007558152,0.0005757498,0.0008173962,0.0001041166,0.00005495672,0.00008255637,0.0001292431,0.2073,0.01070915,0.001373566,0.7774022,0.0006953385],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.523075,0.0003730466,0.001076395,0.001361419,0.0001203317,0.001519471,0.00001947223,0.001302537,0.4711523],"genre_scores_gemma":[0.9940793,0.0002702271,0.00413308,0.0001287577,0.00008149973,0.0001122918,0.00001142056,0.00002081468,0.001162646],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7287787,"threshold_uncertainty_score":0.3904114,"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."}}