{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001266327,0.0003160323,0.0003225273,0.000258886,0.0001247005,0.0001640146,0.0005128971,0.0002739156,0.000006363312],"category_scores_gemma":[0.00005452408,0.0003206728,0.00006622598,0.0003216407,0.0001070783,0.0001562625,0.00006190401,0.0003542118,0.00000461436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002149517,"about_ca_system_score_gemma":0.00009866854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.986342e-7,"about_ca_topic_score_gemma":0.000001495473,"domain_scores_codex":[0.9983416,0.00002405922,0.0003602068,0.0005147479,0.0003118838,0.0004475038],"domain_scores_gemma":[0.998922,0.0004227686,0.0001011022,0.0003552958,0.0001294697,0.00006939345],"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.00000136861,0.000001687318,4.566985e-7,0.00002465768,0.000002989441,8.897601e-7,0.00007055225,0.568441,0.00001376671,0.0004091058,0.00002371456,0.4310098],"study_design_scores_gemma":[0.0001371871,0.00006263868,0.000003279104,0.0002069925,0.000007888527,0.00000854532,1.970081e-8,0.892531,0.0003709136,0.1057752,0.0005882797,0.0003079916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[5.857055e-7,0.0002755652,0.9965668,0.00007694004,0.0006199683,0.0008777154,0.000002486714,0.0003339762,0.001245999],"genre_scores_gemma":[0.0003759256,0.00002149685,0.9985321,0.0001924087,0.0006616417,0.00002398675,0.000009333338,0.00005427488,0.0001289027],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4307018,"threshold_uncertainty_score":0.9999245,"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."}}