{"id":"W3004144975","doi":"10.1007/s00453-023-01201-4","title":"Approximations for Throughput Maximization","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Las vegas; Combinatorics; Schedule; Approximation algorithm; Mathematics; Computer science; Discrete mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.005738887,0.00286791,0.003007311,0.002737106,0.001677524,0.005015148,0.004635413,0.003501099,0.01756413],"category_scores_gemma":[0.03637027,0.001628164,0.002382756,0.004390093,0.00328396,0.006576914,0.003702186,0.006700359,0.003786553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006925167,"about_ca_system_score_gemma":0.00386436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006458182,"about_ca_topic_score_gemma":0.005042696,"domain_scores_codex":[0.9962787,0.001603947,0.0001043161,0.0004644107,0.0009897946,0.0005588349],"domain_scores_gemma":[0.9854813,0.01119081,0.000529227,0.001335886,0.001013389,0.0004493669],"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.0001618914,0.0001087332,0.0003003712,0.0002479635,0.00005640167,0.00008025565,0.0001854097,0.3723985,0.0005399217,0.5744055,0.01761232,0.03390284],"study_design_scores_gemma":[0.00001314658,0.0000141889,0.00007643856,0.00004888192,0.00002031961,0.00003495373,0.00002599119,0.7256126,0.0002196939,0.2705038,0.003420468,0.00000953318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005526538,0.002388264,0.9579864,0.00179934,0.0003542838,0.0001016852,0.0003004216,0.0005282121,0.03101489],"genre_scores_gemma":[0.507787,0.006604339,0.4137339,0.001640507,0.001715962,0.001113834,0.001192608,0.001710911,0.06450081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01756413,"threshold_uncertainty_score":0.0587579,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0185389624597332,"score_gpt":0.2899269528335395,"score_spread":0.2713879903738063,"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."}}