{"id":"W2119251691","doi":"10.1016/j.tcs.2004.05.019","title":"Competitive online routing in geometric graphs","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Mathematics; Routing (electronic design automation); Shortest path problem; Convex polygon; Regular polygon; Discrete mathematics; Computer science; Graph; Geometry","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.002166675,0.001398809,0.002817982,0.001833758,0.002309392,0.004848305,0.004658803,0.00399705,0.01319632],"category_scores_gemma":[0.01505078,0.001195668,0.001044447,0.003684485,0.002529389,0.009668965,0.002702915,0.003115581,0.001359383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00327257,"about_ca_system_score_gemma":0.001909143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004180997,"about_ca_topic_score_gemma":0.005366011,"domain_scores_codex":[0.9977374,0.0009186753,0.00006775976,0.000392673,0.0004780676,0.0004054742],"domain_scores_gemma":[0.9867237,0.009349375,0.001171593,0.0008619017,0.0007751713,0.001118269],"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.0007400746,0.0005104588,0.00138949,0.000589955,0.0001142195,0.0002440365,0.0004491661,0.186613,0.00237986,0.7229257,0.02561625,0.0584279],"study_design_scores_gemma":[0.0001462221,0.0001241053,0.0004281548,0.00003313188,0.00006016385,0.0002028064,0.0001623493,0.4214802,0.0007163447,0.5712863,0.005333217,0.00002713103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3947696,0.004316061,0.5243289,0.007510772,0.0004860477,0.0003211199,0.0009400219,0.0009803616,0.06634708],"genre_scores_gemma":[0.874919,0.002364609,0.09159408,0.0008620986,0.0006389202,0.0002746594,0.0009897952,0.0003925218,0.0279643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01319632,"threshold_uncertainty_score":0.04414606,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01431149959555006,"score_gpt":0.2694103437007924,"score_spread":0.2550988441052424,"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."}}