{"id":"W2094803507","doi":"10.1016/s0012-365x(03)00241-3","title":"Analysis of greedy algorithms on graphs with bounded degrees","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Heuristics; Combinatorics; Bounded function; Sequence (biology); Greedy algorithm; Algorithm; Random graph; Discrete mathematics; Mathematical optimization; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.0005959928,0.0001869421,0.0004100417,0.0005974147,0.0001126914,0.00008055705,0.0007754929,0.00004506585,0.00002923164],"category_scores_gemma":[0.0001270652,0.0001311493,0.0001774052,0.002825939,0.0002053819,0.0002063415,0.00008928506,0.0001365727,0.00001269197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002218281,"about_ca_system_score_gemma":0.00004050864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003906813,"about_ca_topic_score_gemma":0.00001198662,"domain_scores_codex":[0.9982095,0.0001020899,0.0003106419,0.0003336622,0.0006763846,0.0003676874],"domain_scores_gemma":[0.9981298,0.0003182527,0.000188465,0.001117481,0.0001387921,0.0001072208],"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.00000739222,0.0001201747,0.0007047846,0.00003476086,0.0004764244,0.00001109513,0.0009718323,0.001087635,0.00009303664,0.9956768,0.000007566208,0.0008084741],"study_design_scores_gemma":[0.0008049295,0.0007446826,0.001362364,0.0001160815,0.0004583549,0.00002107943,0.0009018849,0.2566201,0.007585137,0.7305775,0.0001855635,0.0006222871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06456934,0.00004700608,0.9241756,0.00004424135,0.00002969352,0.0002144854,0.00001075861,0.00007842609,0.01083046],"genre_scores_gemma":[0.6140214,0.00001046477,0.3856078,0.00002937908,0.000003328857,0.00002033227,0.000003607296,0.0000189923,0.000284644],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5494521,"threshold_uncertainty_score":0.5348113,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02857594893496281,"score_gpt":0.2982504229598212,"score_spread":0.2696744740248584,"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."}}