{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006197549,0.002677368,0.002865375,0.00407968,0.00215528,0.005795953,0.006384124,0.003902176,0.009709852],"category_scores_gemma":[0.05447374,0.001860767,0.001936932,0.00439061,0.006075909,0.01051141,0.00416392,0.004039643,0.001036738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006539938,"about_ca_system_score_gemma":0.004783081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003802435,"about_ca_topic_score_gemma":0.00364061,"domain_scores_codex":[0.9950393,0.002056191,0.0001500784,0.0006386755,0.001106424,0.001009347],"domain_scores_gemma":[0.9196687,0.06784895,0.004102525,0.00271924,0.002885724,0.002774793],"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.000757964,0.0002754166,0.002438786,0.0004531923,0.0001425212,0.0001462073,0.0004942596,0.3587701,0.002458944,0.6050373,0.007113107,0.02191216],"study_design_scores_gemma":[0.00009701376,0.00008046927,0.0004606519,0.0000584307,0.00005460496,0.00007752993,0.0001451412,0.5729127,0.0006120493,0.4243514,0.001126322,0.00002371831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3026081,0.003397885,0.6595966,0.005187052,0.000179288,0.0003263974,0.0006274523,0.001035874,0.02704144],"genre_scores_gemma":[0.8775885,0.002759992,0.09891605,0.001010047,0.0005197013,0.0005337698,0.00112499,0.0009913264,0.0165555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009709852,"threshold_uncertainty_score":0.04745084,"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."}}