{"id":"W2149929647","doi":"10.1109/focs.2006.15","title":"Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Binary logarithm; Logarithm; Approximation algorithm; Algorithm; Embedding; Vertex (graph theory); Discrete mathematics; Mathematics; Graph; Computer science; Artificial intelligence; 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.003546741,0.00233559,0.002580513,0.001311108,0.001119574,0.002707984,0.0040294,0.002925167,0.01119854],"category_scores_gemma":[0.01458317,0.001132366,0.001907323,0.00326776,0.001448174,0.007781372,0.002713517,0.003415328,0.002224622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003123317,"about_ca_system_score_gemma":0.001595982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003067707,"about_ca_topic_score_gemma":0.003898341,"domain_scores_codex":[0.9964366,0.001168127,0.0001776745,0.0008699983,0.0006839991,0.0006636415],"domain_scores_gemma":[0.992985,0.004486725,0.0006129191,0.00123004,0.0004027234,0.0002826496],"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.0009454484,0.0004884095,0.00146316,0.0005763792,0.0001593543,0.0001505806,0.0002274619,0.7638702,0.002604768,0.05853136,0.01534517,0.1556377],"study_design_scores_gemma":[0.00008794154,0.0001055244,0.0001621827,0.00002166213,0.00002735917,0.00009486855,0.00004267359,0.9326559,0.0008386612,0.06419078,0.001758472,0.00001394804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02866988,0.001294011,0.9594544,0.001164532,0.0001166407,0.0001872514,0.000452617,0.001519199,0.007141416],"genre_scores_gemma":[0.4547967,0.001239473,0.5279004,0.0008161186,0.0002879484,0.0005368032,0.00191393,0.0007334397,0.01177528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01119854,"threshold_uncertainty_score":0.03746289,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03388222873633773,"score_gpt":0.2617209479277961,"score_spread":0.2278387191914584,"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."}}