{"id":"W3152988225","doi":"10.1142/s0129054111009148","title":"APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council","keywords":"Euclidean geometry; Geometric networks; Approximation algorithm; Time complexity; Network planning and design; Computer science; Polynomial; Geometric design; Euclidean space; Algorithm; Mathematical optimization; Polynomial-time approximation scheme; Discrete mathematics; Theoretical computer science; Mathematics; Graph theory; Combinatorics; Geometry","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.003083299,0.000122459,0.0002002885,0.001423527,0.0002557469,0.0002132774,0.004280051,0.00003481091,0.00002205355],"category_scores_gemma":[0.0003678165,0.0001109042,0.000142044,0.001943859,0.0004321912,0.002601143,0.0005646765,0.0001283389,0.000009291066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002175879,"about_ca_system_score_gemma":0.0004507694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003475006,"about_ca_topic_score_gemma":6.827626e-7,"domain_scores_codex":[0.9972969,0.00007903558,0.0006862341,0.0002898329,0.001332294,0.0003156888],"domain_scores_gemma":[0.9944882,0.0005615578,0.0007927016,0.0003815213,0.003635444,0.000140514],"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.0002175495,0.0005001686,0.0006009357,0.00001589993,0.0001934111,0.00002136182,0.001526628,0.08315282,0.002315436,0.4080149,0.0009590283,0.5024819],"study_design_scores_gemma":[0.001159925,0.0009196166,0.004485463,0.00008706725,0.00001413282,0.0003420434,0.00001252513,0.6906188,0.02208487,0.2787917,0.00122279,0.0002610701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002881459,0.00006507061,0.9941285,0.000281435,0.00218327,0.0002252613,0.00000302069,0.00002195742,0.0002100331],"genre_scores_gemma":[0.2403138,0.00001666921,0.7593308,0.00006020647,0.0002352911,0.000007925274,0.000001137783,0.000005597767,0.00002856216],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.607466,"threshold_uncertainty_score":0.7953471,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09136408144728773,"score_gpt":0.348300722777904,"score_spread":0.2569366413306162,"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."}}