{"id":"W2571163292","doi":"10.1007/978-3-642-13731-0_19","title":"A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Polynomial-time approximation scheme; Approximation algorithm; Clique graph; Adjacency matrix; Graph; Mathematics; Unit disk graph; Graph partition; Discrete mathematics; Clique; Computer science; Line graph; Graph power","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.002086241,0.002157566,0.003963751,0.001194656,0.001702208,0.003995463,0.005481453,0.003121213,0.008127584],"category_scores_gemma":[0.0103518,0.001073148,0.002647325,0.002384478,0.002071267,0.005394222,0.006364174,0.004767451,0.00175249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002652769,"about_ca_system_score_gemma":0.002868447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002264942,"about_ca_topic_score_gemma":0.001895511,"domain_scores_codex":[0.997461,0.0006578484,0.0001314062,0.0008094495,0.0006493781,0.0002909426],"domain_scores_gemma":[0.9955311,0.002013861,0.0003957829,0.001062391,0.0005595449,0.0004372562],"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.001716825,0.0004320553,0.0009648501,0.001024402,0.0002749157,0.0002751032,0.0005669206,0.4545183,0.02280219,0.3270331,0.02627649,0.1641148],"study_design_scores_gemma":[0.00007549589,0.0001981601,0.000196733,0.00003927964,0.00005631461,0.0001016112,0.00008568178,0.8187019,0.002185414,0.1758739,0.002452594,0.00003296589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03813272,0.0004005546,0.9478562,0.0008237908,0.0001870945,0.0003546444,0.0007126668,0.001340587,0.01019165],"genre_scores_gemma":[0.5295502,0.0006396429,0.4515082,0.000564872,0.0003831606,0.001021241,0.001694532,0.0008397122,0.01379841],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008127584,"threshold_uncertainty_score":0.02718943,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03375501707243674,"score_gpt":0.2611855510918928,"score_spread":0.2274305340194561,"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."}}