{"id":"W1549969148","doi":"10.1007/978-3-540-45198-3_10","title":"Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minimum spanning tree; Spanning tree; Combinatorics; Gomory–Hu tree; Degree (music); k-minimum spanning tree; Bounded function; Steiner tree problem; Kruskal's algorithm; Node (physics); Mathematics; Approximation algorithm; Discrete mathematics; Graph; Distributed minimum spanning tree; Undirected graph; Minimum degree spanning tree; Shortest-path tree; Enhanced Data Rates for GSM Evolution; Tree (set theory); Computer science; K-ary tree; Tree structure; Binary tree; Artificial intelligence","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.001045869,0.0007956761,0.001200138,0.0007024485,0.0004128648,0.001078005,0.001891565,0.001269026,0.002693018],"category_scores_gemma":[0.008006296,0.0004440509,0.0005473081,0.001285329,0.0005568842,0.002063929,0.001466604,0.001235277,0.0005642585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001020537,"about_ca_system_score_gemma":0.0006647061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00209031,"about_ca_topic_score_gemma":0.002574784,"domain_scores_codex":[0.9993418,0.0002279732,0.00002297878,0.0001193436,0.0002040431,0.00008376203],"domain_scores_gemma":[0.9979633,0.001327893,0.0001359829,0.0002232365,0.0002428463,0.0001067437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002624864,0.00007407498,0.000824457,0.000187338,0.00003130776,0.00006969958,0.00008493598,0.8771259,0.003263052,0.03548914,0.005599825,0.07698789],"study_design_scores_gemma":[0.00001351056,0.00002045734,0.0001259335,0.000008532697,0.000006650476,0.00003500287,0.00001569078,0.9785209,0.0004649012,0.02004268,0.0007432704,0.000002590393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08222497,0.000948021,0.9063455,0.0007747538,0.0001336638,0.00005198374,0.0003189158,0.0004480892,0.008753981],"genre_scores_gemma":[0.6291297,0.001019515,0.3628115,0.0001850342,0.0001457911,0.0001241297,0.0007905459,0.0002686848,0.005525116],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002693018,"threshold_uncertainty_score":0.009009063,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03657327550404496,"score_gpt":0.2512355080131645,"score_spread":0.2146622325091196,"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."}}