{"id":"W2003388935","doi":"10.1145/1978782.1978784","title":"How well can primal-dual and local-ratio algorithms perform?","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Alterra Power (Canada); University of Toronto","funders":"","keywords":"Approximation algorithm; Combinatorics; Mathematics; Scheduling (production processes); Set cover problem; Steiner tree problem; Algorithm; Upper and lower bounds; Discrete mathematics; Set (abstract data type); Computer science; Mathematical optimization","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003044746,0.0004547159,0.0003710577,0.0003738446,0.0007513312,0.0003968604,0.001280394,0.0001999804,0.0002023554],"category_scores_gemma":[0.00001836777,0.0004353897,0.000191088,0.000785545,0.0004171056,0.001017499,0.00008523687,0.0006389414,0.00006006671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001008991,"about_ca_system_score_gemma":0.000124879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003249527,"about_ca_topic_score_gemma":0.0001245574,"domain_scores_codex":[0.9973478,0.0001002855,0.0003622743,0.0009489281,0.0005619705,0.000678742],"domain_scores_gemma":[0.9977239,0.0001498303,0.0001155276,0.0014809,0.0001571974,0.0003726295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001662341,0.0003643343,0.00002730634,0.00002211201,0.00009358312,0.00005657161,0.00195298,0.00005301863,0.00005652691,0.008729119,0.00007759937,0.9885502],"study_design_scores_gemma":[0.005489968,0.003950113,0.009481188,0.0001999938,0.0002727627,0.001395032,0.003717068,0.7679198,0.07842036,0.09778697,0.02736033,0.004006385],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002246355,0.0001269848,0.992394,0.002392806,0.0009406452,0.0003507238,0.00004751783,0.0004506078,0.00105033],"genre_scores_gemma":[0.4598715,0.0002228841,0.5377132,0.0006083027,0.0001472426,0.00009590291,0.000008032377,0.00004420395,0.001288752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9845439,"threshold_uncertainty_score":0.9998098,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03917662389539475,"score_gpt":0.2333518551774825,"score_spread":0.1941752312820877,"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."}}