{"id":"W2102501261","doi":"10.1007/978-3-642-13036-6_9","title":"On Generalizations of Network Design Problems with Degree Bounds","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Spanning tree; Degree (music); Matroid; Computer science; Relaxation (psychology); Combinatorial optimization; Mathematical optimization; Intersection (aeronautics); Network planning and design; Algorithm; Mathematics; Discrete mathematics","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.0008393694,0.0005000408,0.0005242057,0.0006582404,0.0004287049,0.0003841952,0.003422656,0.0003099088,0.00002549383],"category_scores_gemma":[0.00004488141,0.0004063189,0.0001109193,0.001153134,0.001318927,0.0003488417,0.0007293565,0.0009748309,0.000009348316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008660655,"about_ca_system_score_gemma":0.0006358525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002099483,"about_ca_topic_score_gemma":0.0002187303,"domain_scores_codex":[0.9965658,0.00004764886,0.000486258,0.001229147,0.001037543,0.000633597],"domain_scores_gemma":[0.9968506,0.0006379689,0.000375314,0.001647084,0.0003371007,0.0001519037],"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.000007707898,0.00004523413,0.00002149402,0.00002687055,0.00001660031,0.00002421171,0.000322421,0.5901599,0.00007191351,0.2469102,0.00003228271,0.1623612],"study_design_scores_gemma":[0.0002080713,0.0005087436,0.00005043828,0.0004506048,0.00000818107,0.00004839709,2.580876e-8,0.4242197,0.000736149,0.5724913,0.0008005252,0.0004778815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002190792,0.0001891211,0.9954185,0.0002785114,0.00125713,0.0004905807,0.000004345603,0.0001236107,0.002216262],"genre_scores_gemma":[0.01313917,0.000026009,0.9855034,0.000701624,0.0003661074,0.00001450563,0.000004652326,0.00003353653,0.0002110402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3255811,"threshold_uncertainty_score":0.9998389,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04049474481597431,"score_gpt":0.2365318855826842,"score_spread":0.1960371407667099,"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."}}