{"id":"W2130189990","doi":"10.1007/978-3-642-02882-3_23","title":"Approximation Algorithms for a Network Design Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monotone polygon; Computer science; Path (computing); Tree (set theory); Mathematical optimization; Constraint (computer-aided design); Routing (electronic design automation); Integer (computer science); Class (philosophy); Algorithm; Mathematics; Combinatorics","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.002286458,0.002250599,0.00175383,0.001169416,0.0006896901,0.001959848,0.002353329,0.002717326,0.008580183],"category_scores_gemma":[0.007657993,0.001125666,0.001702965,0.002392317,0.001140432,0.00275308,0.001653917,0.004053795,0.001512383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002049401,"about_ca_system_score_gemma":0.001219537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003501541,"about_ca_topic_score_gemma":0.003079233,"domain_scores_codex":[0.9989801,0.000443365,0.00003654205,0.0001531375,0.0002986863,0.00008817446],"domain_scores_gemma":[0.9972869,0.002152032,0.0001097739,0.0002034498,0.0001920675,0.00005574725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00010397,0.0001146467,0.0002401732,0.0002635164,0.00005392285,0.0000530409,0.00009215971,0.6937091,0.0005170217,0.1372438,0.01149209,0.1561167],"study_design_scores_gemma":[0.00003626281,0.00002556898,0.0000525156,0.00004896402,0.00002073892,0.00004598994,0.00002103616,0.9063834,0.0002225018,0.08773188,0.005403971,0.000007243618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002419906,0.0008145245,0.9871519,0.0003820535,0.0001140058,0.00005571458,0.00006677746,0.0001559728,0.008839329],"genre_scores_gemma":[0.1288357,0.003230774,0.8457327,0.0003275064,0.0003751268,0.0005807694,0.0004656192,0.0003398163,0.02011194],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008580183,"threshold_uncertainty_score":0.02870357,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03091854809030773,"score_gpt":0.2633602485342117,"score_spread":0.232441700443904,"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."}}