{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001988565,0.001932266,0.002199127,0.00105871,0.000966733,0.00250641,0.00327853,0.002225259,0.008624668],"category_scores_gemma":[0.007936962,0.0008307675,0.00137722,0.002995887,0.00117519,0.006568227,0.002237721,0.003203197,0.001707559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002749282,"about_ca_system_score_gemma":0.001948915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003823546,"about_ca_topic_score_gemma":0.006568219,"domain_scores_codex":[0.998087,0.0005756285,0.00008697295,0.0004871692,0.0003922081,0.0003710164],"domain_scores_gemma":[0.9962766,0.002100251,0.0003613855,0.0008457647,0.000239288,0.0001767255],"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.0006671926,0.0003651895,0.001285007,0.0005360312,0.0001297538,0.0001369793,0.0002521168,0.7249243,0.003341416,0.08446067,0.01943501,0.1644663],"study_design_scores_gemma":[0.00009558122,0.00006399664,0.0001389987,0.00001731866,0.00002954509,0.000074519,0.00006383486,0.9167324,0.000804738,0.07944603,0.0025212,0.00001199236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03032386,0.001181911,0.9581024,0.001070585,0.00011515,0.0001762415,0.0005023454,0.001564341,0.006963183],"genre_scores_gemma":[0.3954516,0.001073226,0.5942636,0.000431553,0.0001935883,0.0003408475,0.002041525,0.0004699723,0.005734062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008624668,"threshold_uncertainty_score":0.0288524,"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."}}