{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002476118,0.002147017,0.001855643,0.001168663,0.0009367306,0.002518439,0.003816016,0.002122305,0.01134392],"category_scores_gemma":[0.009902523,0.00104927,0.00149078,0.003090112,0.001034266,0.006544357,0.002542355,0.00285314,0.002536574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002389286,"about_ca_system_score_gemma":0.0017574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002467097,"about_ca_topic_score_gemma":0.003756498,"domain_scores_codex":[0.9974837,0.0007621233,0.0001514597,0.0005844499,0.0005658954,0.0004522641],"domain_scores_gemma":[0.9945879,0.002846535,0.0005053115,0.001477299,0.0003555485,0.0002273089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001274632,0.0006383481,0.001487751,0.0006862289,0.0001943364,0.0001631714,0.0002886533,0.6306691,0.005807039,0.05873105,0.01965615,0.2804036],"study_design_scores_gemma":[0.0001502026,0.0001121603,0.0001688801,0.0000231243,0.00004485632,0.0001167123,0.00005164093,0.9183702,0.001696976,0.07673083,0.002514826,0.00001954193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01921404,0.0007190388,0.9720091,0.0006151235,0.00008245809,0.0001583477,0.0003342847,0.001911949,0.004955617],"genre_scores_gemma":[0.3007548,0.0007846809,0.6894267,0.0003890696,0.0001567075,0.0004409679,0.001678409,0.0005305565,0.005838037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01134392,"threshold_uncertainty_score":0.0379492,"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."}}