{"id":"W2015242277","doi":"10.1145/1497290.1497295","title":"Bicriteria approximation tradeoff for the node-cost budget problem","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Seventh Framework Programme; Israel Science Foundation","keywords":"Approximation algorithm; Combinatorics; Mathematical optimization; Graph; Mathematics; Profit (economics); Binary logarithm; Computer science; Economics","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.0003950287,0.0002541312,0.0002049719,0.0001915533,0.0008313678,0.0003448503,0.001722236,0.0001035969,0.0000335014],"category_scores_gemma":[0.00002311973,0.0001967729,0.0002416488,0.0007480046,0.00008080101,0.0005917483,0.00001302582,0.0003073256,0.00003345281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005276799,"about_ca_system_score_gemma":0.0000502101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001719888,"about_ca_topic_score_gemma":0.000006039807,"domain_scores_codex":[0.9982876,0.00005777717,0.0003443415,0.000527075,0.0003443009,0.0004388886],"domain_scores_gemma":[0.9980573,0.0004063641,0.00008752371,0.001238229,0.0001069308,0.0001036196],"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.00001683633,0.0002836825,4.933252e-7,0.00001111879,0.0000334931,0.000001534793,0.0005767995,0.001198736,0.0002654909,0.009691632,0.0004820027,0.9874382],"study_design_scores_gemma":[0.001776193,0.0007272134,0.001126484,0.00006808348,0.00007395803,0.00008253956,0.0001287608,0.7873145,0.007942954,0.1589669,0.04109255,0.0006998393],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007910308,0.00009777319,0.9795135,0.01783177,0.0007447693,0.001063278,0.00005689212,0.0003605646,0.0002523094],"genre_scores_gemma":[0.06972212,0.0001007094,0.9270177,0.002159285,0.0002011079,0.0004483814,0.00001569987,0.00002242788,0.0003125452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9867383,"threshold_uncertainty_score":0.8024166,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03665771335899538,"score_gpt":0.282440860536305,"score_spread":0.2457831471773096,"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."}}