{"id":"W6927327761","doi":"10.34726/hss.2013.23219</div>\\n</div&gt","title":"A new partition-based heuristic for the Steiner tree problem in large graphs","year":2013,"lang":"en","type":"article","venue":"reposiTUm (TU Wien)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Steiner tree problem; Heuristic; Tree (set theory); Greedy algorithm; Field (mathematics); Generalization; Class (philosophy); Set (abstract data type); Term (time)","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006463647,0.001116697,0.001299054,0.001113584,0.0008349522,0.001158806,0.002043538,0.00150232,0.003284166],"category_scores_gemma":[0.002009876,0.0007319025,0.001174039,0.001290443,0.0006930666,0.00199477,0.001453497,0.001130817,0.0006826977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001294398,"about_ca_system_score_gemma":0.001744205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003216981,"about_ca_topic_score_gemma":0.004598895,"domain_scores_codex":[0.9993808,0.0001605536,0.00002991421,0.0001370892,0.0001669426,0.0001246488],"domain_scores_gemma":[0.9993493,0.0003622357,0.00006267093,0.00008282525,0.00008676272,0.00005623596],"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.0001569361,0.0001766138,0.0004995267,0.000187227,0.00006730286,0.0001504047,0.0001708043,0.7994518,0.005992892,0.02185234,0.007857727,0.1634363],"study_design_scores_gemma":[0.0000442389,0.00006189333,0.0001092932,0.00001883781,0.00002083307,0.00006521061,0.00003723513,0.9875872,0.001143191,0.008177247,0.002723834,0.00001100649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02017902,0.000582402,0.9727061,0.0002521167,0.000103652,0.0002526629,0.0001263235,0.0006158,0.005181834],"genre_scores_gemma":[0.1561177,0.0004080991,0.8383116,0.0002525349,0.00008326305,0.0004430742,0.000630155,0.0002821214,0.003471519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003284166,"threshold_uncertainty_score":0.01098663,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01438074755492386,"score_gpt":0.2338831495893332,"score_spread":0.2195024020344094,"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."}}