{"id":"W2151077859","doi":"10.1007/11523468_76","title":"How Well Can Primal-Dual and Local-Ratio Algorithms Perform?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Steiner tree problem; Combinatorics; Scheduling (production processes); Approximation algorithm; Dual (grammatical number); Computer science; Mathematics; Set cover problem; Set (abstract data type); Tree (set theory); Algorithm; Discrete mathematics; 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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007459827,0.000778555,0.0006805797,0.0008797436,0.0005715665,0.001745643,0.002773772,0.0004073822,0.00003714185],"category_scores_gemma":[0.00003994551,0.0007199451,0.0001572298,0.000676453,0.001946533,0.00104857,0.002120938,0.001247225,0.00002015921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003563109,"about_ca_system_score_gemma":0.0006275115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004446621,"about_ca_topic_score_gemma":0.0002907394,"domain_scores_codex":[0.9951402,0.00003942006,0.0004987544,0.002079987,0.001283638,0.0009580301],"domain_scores_gemma":[0.9972783,0.0003465891,0.0002818199,0.001480041,0.0002653967,0.0003478419],"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.000002696123,0.00002558897,0.00001917116,0.00003084208,0.00001241226,0.00008086767,0.0005607199,0.00298727,0.00001954018,0.0492116,0.00002488037,0.9470244],"study_design_scores_gemma":[0.0003866215,0.0002819732,0.0001357264,0.0002152112,0.00001204893,0.0003141236,0.000001012093,0.8671533,0.001144088,0.1170308,0.01228617,0.00103883],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008991639,0.0008454549,0.9907029,0.004167761,0.001389147,0.0004148163,0.00001372148,0.0002124705,0.002163773],"genre_scores_gemma":[0.1153875,0.0002594848,0.8779598,0.002716433,0.001667149,0.00001625908,0.00001393604,0.0000627957,0.001916587],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9459856,"threshold_uncertainty_score":0.9995252,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01625972781171476,"score_gpt":0.2245268484318692,"score_spread":0.2082671206201544,"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."}}