{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001608383,0.0004886973,0.000439403,0.0003726776,0.00026882,0.0004013008,0.001044461,0.0002895681,0.00002523726],"category_scores_gemma":[0.0001947459,0.0003848127,0.0001098709,0.0004978981,0.0004398449,0.0001962665,0.0002358509,0.0009755607,0.00001353645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002584404,"about_ca_system_score_gemma":0.00009714867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003518359,"about_ca_topic_score_gemma":0.00001787464,"domain_scores_codex":[0.9974591,0.00006691791,0.0005786362,0.0006978452,0.00058143,0.000616052],"domain_scores_gemma":[0.9981056,0.0007495199,0.0001804298,0.0007617081,0.0001112651,0.00009142702],"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.000001026075,0.00000372485,0.00004327659,0.00006096682,0.00001359065,0.000007493865,0.0007531206,0.6385782,0.0001560262,0.0005220427,0.00002181477,0.3598387],"study_design_scores_gemma":[0.0001612712,0.00002859389,0.00002702283,0.0003432966,0.00001581298,0.00003877653,5.54251e-7,0.9781695,0.001065458,0.01880267,0.0008418608,0.0005051624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001081096,0.0003692255,0.9806091,0.000206945,0.0009012582,0.0004418283,0.000002074323,0.0002804452,0.01708106],"genre_scores_gemma":[0.01123153,0.00001415485,0.9874771,0.0005951166,0.0002854221,0.00001614244,0.000003259482,0.0001038048,0.0002735237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3593335,"threshold_uncertainty_score":0.9998604,"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."}}