{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001387223,0.0009217414,0.001434031,0.0009492036,0.0006431022,0.001605285,0.002076856,0.00198898,0.003343654],"category_scores_gemma":[0.01285773,0.0005401938,0.0006619586,0.001664801,0.0008102807,0.003059224,0.001679361,0.001494982,0.0006331037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302564,"about_ca_system_score_gemma":0.0009975362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002270858,"about_ca_topic_score_gemma":0.003215917,"domain_scores_codex":[0.9991314,0.0003282674,0.00003282604,0.0001834866,0.0002057474,0.0001183379],"domain_scores_gemma":[0.9959413,0.0029461,0.000274065,0.0003148344,0.0003099176,0.000213914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005126552,0.0001547247,0.002078874,0.0003820682,0.00006816661,0.0001140453,0.000164951,0.8349798,0.003457535,0.06297056,0.01060334,0.08451325],"study_design_scores_gemma":[0.00003637481,0.00003488304,0.0002416959,0.00001747909,0.00001760629,0.00005831223,0.00003643738,0.9512646,0.0005843345,0.04658049,0.001123538,0.000004268547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1824057,0.002455052,0.7973991,0.002755455,0.0002330878,0.00008979918,0.0007501451,0.0005850928,0.01332676],"genre_scores_gemma":[0.7183557,0.00143094,0.2728746,0.0002881809,0.000205196,0.0001377599,0.001136156,0.0002756689,0.005295882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003343654,"threshold_uncertainty_score":0.01118559,"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."}}