{"id":"W2549040639","doi":"10.7939/r3bk17130","title":"Approximation Algorithms for Clustering Problems","year":2012,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; University of Alberta","keywords":"Approximation algorithm; Polynomial-time approximation scheme; Facility location problem; Cluster analysis; Combinatorics; Set (abstract data type); Euclidean geometry; Singleton; Time complexity; Mathematics; Euclidean distance; Constant (computer programming); Metric (unit); Cluster (spacecraft); Integer (computer science); Polynomial; Point (geometry); Mathematical optimization; Computer science; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.00007007895,0.00007416228,0.0001060634,0.00009835899,0.0001295091,0.00002785146,0.0005772838,0.00004384791,0.00004539935],"category_scores_gemma":[0.000006431834,0.00008627035,0.00008066821,0.0002064349,0.00004864696,0.002584378,0.0003367274,0.000049012,0.00000969248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007518405,"about_ca_system_score_gemma":0.00002265322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009708654,"about_ca_topic_score_gemma":0.00001150543,"domain_scores_codex":[0.9994599,0.00002140201,0.00008340145,0.0001470029,0.00008888335,0.0001994746],"domain_scores_gemma":[0.9994609,0.0001351689,0.0000727949,0.0002363224,0.00001595545,0.00007887062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006481035,0.0007068078,0.008449637,0.0005604609,0.0001604687,0.000002738658,0.04780895,0.000646984,0.0003312121,0.7720972,0.01365746,0.1555133],"study_design_scores_gemma":[0.00139904,0.0001983049,0.005011753,0.0001104958,0.00002762368,0.00001698444,0.0007375423,0.7722206,0.002084037,0.02017426,0.1974724,0.0005470362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006847177,0.00007880497,0.9809272,0.0008713421,0.0002490037,0.000234044,0.000002903691,0.00009259113,0.01069699],"genre_scores_gemma":[0.1550088,0.00002368174,0.8408772,0.00011641,0.0001107609,8.883285e-7,0.00003174812,0.00001114553,0.003819384],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7715735,"threshold_uncertainty_score":0.3518003,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02532356458043734,"score_gpt":0.2037639425050022,"score_spread":0.1784403779245649,"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."}}