{"id":"W2026680711","doi":"10.1142/s179383091100136x","title":"DIAMETER-CONSTRAINED STEINER TREES","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Bounded function; Gomory–Hu tree; Tree (set theory); k-minimum spanning tree; Connected dominating set; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; K-ary tree; Minimum spanning tree; Topology (electrical circuits); Tree structure; Computer science; Binary tree; Telecommunications","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.0004085815,0.0006516814,0.0008545695,0.0006774548,0.000608784,0.0009969705,0.001333068,0.0008883189,0.003920335],"category_scores_gemma":[0.003152581,0.0005845281,0.0006324403,0.00156488,0.0003551666,0.002197125,0.001342923,0.000608654,0.000644753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006620465,"about_ca_system_score_gemma":0.0006062066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009288329,"about_ca_topic_score_gemma":0.001530722,"domain_scores_codex":[0.9995489,0.0001037748,0.00003401357,0.0001262847,0.0001201148,0.0000670478],"domain_scores_gemma":[0.9991834,0.00032295,0.0001518878,0.0001654971,0.0000978981,0.00007845806],"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.0006053853,0.0001106623,0.00196017,0.000652555,0.0001140393,0.000529323,0.0003209034,0.6480113,0.02624366,0.1550345,0.01536623,0.1510513],"study_design_scores_gemma":[0.00007053762,0.000167906,0.001033146,0.00007029345,0.00004539404,0.0006000488,0.0001545257,0.7753725,0.005434002,0.2038975,0.01312428,0.00002980587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.116342,0.0008062556,0.8686553,0.0004441048,0.00007544574,0.0001812274,0.001696476,0.0004966495,0.01130258],"genre_scores_gemma":[0.5101765,0.001144424,0.4790427,0.0001455343,0.00007250812,0.0002315161,0.002722628,0.0002164253,0.006247743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003920335,"threshold_uncertainty_score":0.01311487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03432157415003299,"score_gpt":0.2854218560093663,"score_spread":0.2511002818593333,"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."}}