{"id":"W2298220966","doi":"10.1016/j.disopt.2017.09.003","title":"The quadratic minimum spanning tree problem and its variations","year":2017,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanning tree; Minimum spanning tree; Distributed minimum spanning tree; Combinatorics; Euclidean minimum spanning tree; Matroid; Mathematics; Context (archaeology); Kruskal's algorithm; Bottleneck; k-minimum spanning tree; Quadratic equation; Tree (set theory); Simple (philosophy); Minimum degree spanning tree; Discrete mathematics; Binary tree; K-ary tree; Computer science; Tree structure","routes":{"ca_aff":true,"ca_fund":true,"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.001517077,0.0008392276,0.0009107669,0.0007760111,0.0004931719,0.001467461,0.001459515,0.001572834,0.003067486],"category_scores_gemma":[0.006026831,0.0004116881,0.0005566253,0.001722713,0.001480823,0.003065532,0.001525369,0.00272954,0.0005187792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008440414,"about_ca_system_score_gemma":0.000759693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002341058,"about_ca_topic_score_gemma":0.002094812,"domain_scores_codex":[0.9993525,0.0002641418,0.00002219698,0.0001566147,0.0001712815,0.00003330375],"domain_scores_gemma":[0.9985955,0.0008816175,0.0001599034,0.00008787614,0.0001909323,0.0000841293],"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.00006870428,0.00008210124,0.0003176584,0.0002778178,0.00003970346,0.00006828056,0.00009951907,0.2614501,0.001265475,0.6656554,0.008661376,0.06201378],"study_design_scores_gemma":[0.0000120435,0.00002085235,0.0001691745,0.00001920452,0.00001111597,0.00006324032,0.00002368088,0.6408992,0.0001508898,0.3511497,0.007469176,0.0000116699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01336447,0.004794541,0.9666029,0.001542873,0.0003101139,0.00002223701,0.0001568163,0.00006574594,0.0131404],"genre_scores_gemma":[0.5469143,0.0133954,0.3913395,0.0009803608,0.001967686,0.0002549019,0.0007509443,0.0004326235,0.04396438],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003067486,"threshold_uncertainty_score":0.01026177,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02206177484825251,"score_gpt":0.2821296063690162,"score_spread":0.2600678315207637,"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."}}