{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004142599,0.003607125,0.003434077,0.002689,0.00251444,0.004991116,0.005505628,0.004113647,0.01075252],"category_scores_gemma":[0.0197825,0.001570838,0.003160709,0.006415665,0.001809751,0.007121648,0.003668273,0.006300698,0.003769505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005926326,"about_ca_system_score_gemma":0.002882858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005466422,"about_ca_topic_score_gemma":0.006149065,"domain_scores_codex":[0.995528,0.001517813,0.0003535923,0.00102372,0.0009565889,0.0006204131],"domain_scores_gemma":[0.9915632,0.00577746,0.0004822679,0.001131123,0.0007961019,0.0002497649],"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.0003027426,0.0002981992,0.001012487,0.000982276,0.0002549792,0.0001033273,0.0004133981,0.5917655,0.0007466899,0.2057275,0.03482885,0.1635641],"study_design_scores_gemma":[0.00008947248,0.00005059039,0.0001596372,0.00009934216,0.00004247756,0.0001187722,0.0001313079,0.76298,0.000384068,0.2245127,0.01140778,0.00002391771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007316094,0.003320913,0.9703049,0.002000235,0.0003573913,0.0003052656,0.0007285601,0.001458558,0.01420804],"genre_scores_gemma":[0.1371811,0.005056421,0.8401342,0.001044086,0.0006864034,0.0009746092,0.003825927,0.0007869094,0.01031035],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01075252,"threshold_uncertainty_score":0.04299873,"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."}}