{"id":"W2174409790","doi":"10.1007/s10107-012-0537-8","title":"On generalizations of network design problems with degree bounds","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Spanning tree; Degree (music); Combinatorics; Matroid; Rounding; Approximation algorithm; Minimum spanning tree; Discrete mathematics; Bounded function; Mathematical analysis","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.005758535,0.002967932,0.002783915,0.002798975,0.001742202,0.00402128,0.003949897,0.003292363,0.007942487],"category_scores_gemma":[0.03055819,0.001485099,0.003519433,0.004655064,0.003798649,0.01314742,0.004686691,0.008297835,0.0006903984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003980506,"about_ca_system_score_gemma":0.001593173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003537009,"about_ca_topic_score_gemma":0.003478171,"domain_scores_codex":[0.9962903,0.001886445,0.0001492309,0.0007017318,0.0006086724,0.0003635153],"domain_scores_gemma":[0.9751857,0.01969499,0.001562816,0.001716687,0.0008630512,0.0009767953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007376295,0.0001357466,0.0006241876,0.0002500505,0.00006618845,0.0001093519,0.0002208646,0.1347251,0.0004030266,0.8392531,0.007274889,0.01686367],"study_design_scores_gemma":[0.00001702638,0.00001628927,0.0001516353,0.00003733729,0.00002234226,0.00003887477,0.00003815498,0.1381956,0.0000852224,0.8585446,0.002841114,0.00001194524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06501208,0.005586188,0.8665271,0.008335351,0.0006292006,0.0001673468,0.0005906865,0.0002333597,0.05291867],"genre_scores_gemma":[0.6533319,0.01729601,0.2721326,0.003248354,0.005553307,0.0008458666,0.001709359,0.0006757845,0.04520675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007942487,"threshold_uncertainty_score":0.03045446,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08827442949770972,"score_gpt":0.2684862981794572,"score_spread":0.1802118686817475,"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."}}