{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003178744,0.0001709249,0.0001852751,0.0001340357,0.0002726977,0.000298846,0.0007980887,0.00005633855,0.00003617437],"category_scores_gemma":[0.0000502037,0.0001227961,0.0001576167,0.0006704362,0.00004870344,0.0006713662,0.0001256935,0.0001598015,0.00004414307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003260219,"about_ca_system_score_gemma":0.0001259499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004192193,"about_ca_topic_score_gemma":0.0006749121,"domain_scores_codex":[0.9984313,0.00006246427,0.0003488155,0.0004255789,0.0002666965,0.0004651306],"domain_scores_gemma":[0.9985515,0.0003958103,0.0001110713,0.0007257981,0.00009881576,0.0001169541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003406888,0.0007182201,0.006838639,0.0001479007,0.00008292469,0.00005195027,0.001495848,0.001216222,0.001323088,0.8828822,0.02024091,0.08496805],"study_design_scores_gemma":[0.00228062,0.0003483963,0.03121619,0.0001556208,0.00003100426,0.00003523444,0.00004936257,0.5940102,0.001257617,0.3521657,0.01790893,0.0005410631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004816087,0.0003323119,0.9875103,0.00449839,0.0003842874,0.001094823,0.000006315046,0.0001682425,0.001189237],"genre_scores_gemma":[0.9139323,0.000006442392,0.08360667,0.0007692823,0.00009531627,0.000471361,0.000007073087,0.00001589952,0.001095618],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9091163,"threshold_uncertainty_score":0.500748,"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."}}