{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00465077,0.002859927,0.002564447,0.002710149,0.001715098,0.003531028,0.004148528,0.003392454,0.009877355],"category_scores_gemma":[0.02414409,0.001601689,0.003400181,0.004961188,0.003301646,0.01176972,0.004826349,0.008070607,0.0009125737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00305998,"about_ca_system_score_gemma":0.00104801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002528689,"about_ca_topic_score_gemma":0.002482467,"domain_scores_codex":[0.9968828,0.001459467,0.000146162,0.0006325226,0.0005681753,0.0003108754],"domain_scores_gemma":[0.9820272,0.01400777,0.001011643,0.001499575,0.0006329704,0.0008207949],"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.0000960145,0.0001252284,0.0005325374,0.0003322848,0.00006691868,0.0001389555,0.0002404848,0.09767848,0.0005592751,0.8582147,0.01247347,0.02954171],"study_design_scores_gemma":[0.00002043755,0.0000166883,0.0001222113,0.0000457012,0.00002265547,0.0000613747,0.00004055386,0.07475651,0.0001081579,0.9204031,0.00439241,0.00001026736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06632829,0.008933495,0.8214318,0.00829212,0.001050132,0.0002517126,0.0008440475,0.0003961948,0.09247223],"genre_scores_gemma":[0.6024093,0.02137503,0.2921928,0.003342224,0.006201587,0.0008867568,0.002590815,0.0008083528,0.07019306],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009877355,"threshold_uncertainty_score":0.03304303,"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."}}