{"id":"W3021716813","doi":"10.1007/s00453-009-9293-4","title":"Computing the Greedy Spanner in Near-Quadratic Time","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Society for the Study of School Psychology","keywords":"Spanner; Greedy algorithm; Combinatorics; Dimension (graph theory); Logarithm; Mathematics; Time complexity; Running time; Upper and lower bounds; Bounded function; Quadratic equation; Binary logarithm; Metric space; Metric (unit); Euclidean space; Discrete mathematics; Computer science; Algorithm","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.001301613,0.001381709,0.001822817,0.00112863,0.0008878325,0.002202589,0.002017187,0.001650626,0.02085748],"category_scores_gemma":[0.007295846,0.0006672716,0.001142719,0.001687837,0.001362283,0.004627681,0.002736863,0.00193286,0.003725673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211932,"about_ca_system_score_gemma":0.001847648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002468606,"about_ca_topic_score_gemma":0.006054221,"domain_scores_codex":[0.998758,0.0003163158,0.00006696498,0.0003236216,0.0003260935,0.0002091119],"domain_scores_gemma":[0.9973443,0.001726864,0.0001156844,0.0004557427,0.0001806908,0.0001767326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001681956,0.0004410144,0.002852468,0.0007811816,0.0002149643,0.0002671628,0.0003054467,0.3812455,0.01089034,0.1426607,0.04098812,0.4176712],"study_design_scores_gemma":[0.0001629324,0.0001211587,0.000346235,0.00002752195,0.00004752673,0.0001120507,0.0001417493,0.728106,0.002499416,0.2648794,0.003538264,0.00001773849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09447374,0.0009170935,0.8776708,0.001488544,0.0003281608,0.0001907824,0.0008979233,0.003785819,0.02024717],"genre_scores_gemma":[0.3956087,0.0004003259,0.5877826,0.0004455843,0.00016192,0.0002943044,0.002069125,0.001042608,0.01219493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02085748,"threshold_uncertainty_score":0.06977522,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006244191694777135,"score_gpt":0.2270014671969099,"score_spread":0.2207572755021327,"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."}}