{"id":"W1887036206","doi":"10.1007/978-3-642-31155-0_7","title":"On Minimum Sum of Radii and Diameters Clustering","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Euclidean geometry; Approximation algorithm; Metric (unit); Cluster analysis; Shortest path problem; Polynomial-time approximation scheme; Euclidean distance; Mathematics; Plane (geometry); Graph; Singleton; Path (computing); Polynomial; Discrete mathematics; Computer science; Mathematical analysis; 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.002644686,0.002568203,0.003745237,0.003419459,0.002211798,0.00361459,0.006914321,0.003484465,0.007156359],"category_scores_gemma":[0.01650593,0.001533699,0.001965381,0.008086165,0.003106732,0.008248325,0.005457217,0.004944125,0.002841988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004102853,"about_ca_system_score_gemma":0.001297426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002881303,"about_ca_topic_score_gemma":0.002705642,"domain_scores_codex":[0.9965643,0.001216539,0.0001830139,0.0006525572,0.001172411,0.0002110781],"domain_scores_gemma":[0.9939306,0.00347093,0.0003860834,0.001037727,0.0008753635,0.0002993883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003175055,0.00008415178,0.0006000705,0.0007228478,0.0001211176,0.00008623698,0.0004343359,0.1457523,0.002635239,0.6186022,0.04103896,0.1896051],"study_design_scores_gemma":[0.00002585371,0.00004926587,0.0004527818,0.00009204365,0.00004348655,0.0002580635,0.0001251505,0.2324763,0.001231074,0.7472202,0.01798104,0.0000448124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01041384,0.007794301,0.952239,0.00226788,0.0008144872,0.0001061355,0.0004952143,0.0007188428,0.02515017],"genre_scores_gemma":[0.1848312,0.01045559,0.761345,0.001072235,0.002976606,0.0004979673,0.001877212,0.001722277,0.03522194],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007156359,"threshold_uncertainty_score":0.02976847,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01856273433713109,"score_gpt":0.2325672587037544,"score_spread":0.2140045243666233,"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."}}