{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00174725,0.0002245823,0.0002432819,0.0002833483,0.0007859828,0.0006966515,0.002875177,0.00006713894,0.00001366702],"category_scores_gemma":[0.00008887449,0.0001956223,0.000134005,0.00188007,0.00151522,0.001038112,0.000435877,0.000182439,0.00000923166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004867564,"about_ca_system_score_gemma":0.0001182562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001462944,"about_ca_topic_score_gemma":2.038506e-7,"domain_scores_codex":[0.9972036,0.00006463123,0.0003370957,0.0009890812,0.0006783737,0.0007271548],"domain_scores_gemma":[0.9981064,0.0001935084,0.00008893233,0.0009617027,0.0003592432,0.000290231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003646216,0.00009263529,0.000003821096,0.000004887981,0.000002166078,0.000001642646,0.0001851002,0.008278796,0.00006952713,0.8575188,0.00003804529,0.1338009],"study_design_scores_gemma":[0.0002013498,0.0003282048,0.0001681718,0.00001406986,0.00000260669,0.00001500694,0.000001111623,0.5764737,0.0005009174,0.4220038,0.0001185688,0.0001724051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005057651,0.00003709225,0.9943877,0.002289499,0.0007678637,0.0004928538,0.000003153821,0.0004139301,0.001102083],"genre_scores_gemma":[0.2879777,0.000006881888,0.7110981,0.0007379367,0.0001553125,0.00001205225,0.000001801682,0.000004754424,0.000005502006],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5681949,"threshold_uncertainty_score":0.7977244,"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."}}