{"id":"W2136026170","doi":"10.1016/j.tcs.2009.09.033","title":"Priority algorithms for graph optimization problems","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Greedy algorithm; Algorithm; Mathematical optimization; 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.004400032,0.001387461,0.002135134,0.001680215,0.002008196,0.004804303,0.003828075,0.001965639,0.009390961],"category_scores_gemma":[0.0215774,0.000941883,0.001254496,0.002790374,0.001838582,0.009147679,0.002804182,0.005682131,0.001796612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003117679,"about_ca_system_score_gemma":0.003174428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003327579,"about_ca_topic_score_gemma":0.003916138,"domain_scores_codex":[0.9973952,0.0009533138,0.0001319451,0.000367445,0.0007107388,0.0004413343],"domain_scores_gemma":[0.9869853,0.009215435,0.0005850996,0.001363262,0.0009998954,0.0008510766],"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.0006380369,0.0003453948,0.0006279495,0.0005500492,0.00006623501,0.00005613048,0.0003204048,0.07022899,0.001494043,0.7632924,0.02174089,0.1406395],"study_design_scores_gemma":[0.0001673709,0.00008867894,0.0001593313,0.00003144765,0.00003573265,0.00004349433,0.00006372356,0.2184321,0.0006898586,0.7732954,0.006974947,0.00001785744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01739556,0.002209711,0.9633892,0.002150514,0.0004988555,0.0001432235,0.0001472572,0.0007668624,0.0132988],"genre_scores_gemma":[0.4230232,0.004246693,0.5408823,0.001269692,0.001622211,0.000530013,0.0009516903,0.0009631354,0.02651104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009390961,"threshold_uncertainty_score":0.03141588,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02004591870839762,"score_gpt":0.2708548621187035,"score_spread":0.2508089434103059,"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."}}