{"id":"W2592554260","doi":"10.1016/j.cor.2017.10.003","title":"Online algorithms for the maximum k-colorable subgraph problem","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Colored; Online algorithm; Combinatorics; Benchmark (surveying); Algorithm; Mathematics; Computer science; Competitive analysis; Greedy coloring; Graph; Upper and lower bounds","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.002029984,0.001531661,0.001979472,0.001527952,0.001180593,0.002989126,0.004487452,0.002518628,0.01566834],"category_scores_gemma":[0.00894256,0.0009001048,0.00150139,0.003197192,0.001186326,0.005712745,0.002302322,0.003065561,0.001680358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003342218,"about_ca_system_score_gemma":0.004653822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008176839,"about_ca_topic_score_gemma":0.01365086,"domain_scores_codex":[0.9983015,0.0005280419,0.00007533289,0.0004553517,0.0002738774,0.0003659164],"domain_scores_gemma":[0.9911909,0.006340088,0.0006231626,0.0009906894,0.0003557342,0.0004993511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001595448,0.002121363,0.002053109,0.001167208,0.0002179754,0.0001803402,0.0002952809,0.4652869,0.004416862,0.08363266,0.03550359,0.4035293],"study_design_scores_gemma":[0.0004192121,0.0001411918,0.0005559933,0.00005321294,0.00007941713,0.0000945233,0.00009166521,0.8649011,0.00129074,0.1286781,0.003671243,0.00002363407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08093157,0.001917727,0.8783356,0.003368223,0.0004062341,0.0006438326,0.001786764,0.00373885,0.02887113],"genre_scores_gemma":[0.4639516,0.001138403,0.5191993,0.0005524505,0.000409424,0.0006520638,0.00246892,0.0007017367,0.01092611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01566834,"threshold_uncertainty_score":0.05241579,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.4906069269434795,"score_gpt":0.5419991593872532,"score_spread":0.05139223244377367,"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."}}