{"id":"W2564729024","doi":"10.1016/j.comgeo.2004.04.003","title":"Approximating geometric bottleneck shortest paths","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"","keywords":"Delaunay triangulation; Shortest path problem; Bottleneck; Computer science; Combinatorics; Point set triangulation; Path (computing); Graph; Discrete mathematics; 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.001444254,0.001697251,0.001928001,0.003076814,0.0007770167,0.00190984,0.003098623,0.001995059,0.009173319],"category_scores_gemma":[0.01304942,0.001312756,0.0009010539,0.002575678,0.001115244,0.002854864,0.00318701,0.001893346,0.001348213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00191849,"about_ca_system_score_gemma":0.001409127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004437205,"about_ca_topic_score_gemma":0.005963519,"domain_scores_codex":[0.9987815,0.0002601121,0.00004908128,0.0002548083,0.0004936665,0.0001608903],"domain_scores_gemma":[0.9953956,0.002964386,0.0002601558,0.0005019517,0.0006620823,0.0002158453],"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.0005083415,0.0001589624,0.001121138,0.0002404894,0.00005638339,0.0001312559,0.0001494757,0.8206804,0.003056111,0.06162683,0.006807463,0.1054631],"study_design_scores_gemma":[0.00001479405,0.00002507804,0.00006692504,0.000007806623,0.000006755728,0.00002423954,0.00002293971,0.9786582,0.0006742489,0.01955969,0.0009356784,0.000003598145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06752964,0.0004737355,0.9219762,0.0002502985,0.0001140503,0.000109761,0.0003071882,0.001164409,0.008074639],"genre_scores_gemma":[0.4633123,0.0004962659,0.5245091,0.0001026473,0.00009913946,0.0002500516,0.001357003,0.000719597,0.00915393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009173319,"threshold_uncertainty_score":0.03068775,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01591962100472446,"score_gpt":0.2435223757131707,"score_spread":0.2276027547084463,"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."}}