{"id":"W1999760725","doi":"10.1007/s00453-004-1121-2","title":"Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Minimum spanning tree; Combinatorics; Spanning tree; Mathematics; Degree (music); k-minimum spanning tree; Bounded function; Gomory–Hu tree; Theory of computation; Steiner tree problem; Approximation algorithm; Shortest-path tree; Discrete mathematics; Graph; Node (physics); Kruskal's algorithm; Undirected graph; Connected dominating set; Algorithm; K-ary tree; Tree structure; Binary tree","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":[],"consensus_categories":[],"category_scores_codex":[0.0005376485,0.0001618678,0.0001541765,0.00008703167,0.0003679751,0.0004483937,0.001061448,0.00006063608,0.00001615326],"category_scores_gemma":[0.00006592167,0.0001124409,0.00008102244,0.000545387,0.00009941348,0.0004859102,0.0003195694,0.0002446387,0.0001103462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006341445,"about_ca_system_score_gemma":0.0001195621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000466144,"about_ca_topic_score_gemma":0.00001220501,"domain_scores_codex":[0.9983756,0.00008767086,0.0003124561,0.0003889736,0.0003811875,0.0004540901],"domain_scores_gemma":[0.9989854,0.0001251206,0.0001134432,0.0005675566,0.00009853835,0.0001099372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007587432,0.0002716551,0.0001242468,0.00005389705,0.0001031323,0.00004333698,0.01048267,0.007435221,0.001304501,0.178711,0.001337834,0.8001249],"study_design_scores_gemma":[0.002161188,0.0002774021,0.0004613686,0.0001334163,0.00001846505,0.00009988651,0.0003126824,0.8737757,0.005205926,0.1080647,0.008770165,0.0007190278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008489597,0.00006788761,0.9805403,0.006563332,0.0001548909,0.0003956101,0.000001101784,0.000254563,0.0111733],"genre_scores_gemma":[0.07884693,0.000007089021,0.9193835,0.001020126,0.0001120146,0.0000724894,0.000004064192,0.00001987575,0.0005338662],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8663405,"threshold_uncertainty_score":0.4585207,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04624586313923365,"score_gpt":0.256247606757736,"score_spread":0.2100017436185024,"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."}}