{"id":"W2151534739","doi":"10.5555/1283383.1283519","title":"Approximation algorithms for node-weighted buy-at-bulk network design","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Approximation algorithm; Logarithm; Node (physics); Network planning and design; Computer science; Approximation theory; Constant (computer programming); Algorithm; Mathematics; Mathematical optimization; Physics; Computer network; Mathematical analysis","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.002659084,0.0007302454,0.0006540345,0.0004104645,0.001144332,0.0004155391,0.00199944,0.0003513581,0.00004048927],"category_scores_gemma":[0.00005746933,0.0006847922,0.0004615904,0.00144603,0.0002881601,0.0007848977,0.0005665361,0.0004333154,0.0001474409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000335698,"about_ca_system_score_gemma":0.0001124081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002765846,"about_ca_topic_score_gemma":0.00001001879,"domain_scores_codex":[0.9944519,0.0002068695,0.001001812,0.001544147,0.001059324,0.001735901],"domain_scores_gemma":[0.9961106,0.001065949,0.0004334066,0.00158308,0.0003189341,0.0004880311],"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.001219232,0.001480397,0.0001828604,0.0003272009,0.0008269263,0.0002855684,0.003495274,0.03999732,0.006597547,0.4344666,0.04576712,0.4653539],"study_design_scores_gemma":[0.002061637,0.0009787054,0.0002055418,0.0001165651,0.00005602706,0.00007213781,0.00003628668,0.9038568,0.01637665,0.04768504,0.02732657,0.001228071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002274241,0.0003058084,0.9896402,0.001811586,0.002620941,0.00171276,0.00007328043,0.0008062034,0.002801796],"genre_scores_gemma":[0.006060415,0.00009023098,0.9886528,0.001301896,0.001787468,0.0003077452,0.0002023399,0.0001101735,0.001486901],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8638594,"threshold_uncertainty_score":0.9995603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03280088017898276,"score_gpt":0.2760675828761797,"score_spread":0.243266702697197,"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."}}