{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001365261,0.0006422711,0.0006656382,0.001540504,0.0003909218,0.000626113,0.003852586,0.0005888367,0.00002520844],"category_scores_gemma":[0.0001484673,0.000627925,0.0002770637,0.001191043,0.001109542,0.0007669437,0.001098619,0.001532642,0.00001761243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001376347,"about_ca_system_score_gemma":0.0005203228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005826452,"about_ca_topic_score_gemma":0.001645036,"domain_scores_codex":[0.9955618,0.0000538951,0.0007560638,0.001868115,0.000794375,0.0009657033],"domain_scores_gemma":[0.9966865,0.000890967,0.0003323439,0.001577665,0.0002878226,0.0002246882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003500258,0.0001940957,0.0002698834,0.0001482109,0.00002293866,0.0001248521,0.001375553,0.01778129,0.0006606023,0.4077991,0.0000538065,0.5715347],"study_design_scores_gemma":[0.0003940962,0.0002244613,0.0003316703,0.0003436177,0.000007136844,0.00004098499,2.859709e-7,0.333956,0.0009212633,0.6594312,0.003656426,0.0006928569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005077657,0.0002097939,0.9929474,0.001265467,0.002917646,0.0008680585,0.00002995714,0.0001727776,0.001081115],"genre_scores_gemma":[0.07476274,0.00008433083,0.9224043,0.001676506,0.0006115274,0.0001031418,0.00003270604,0.00005997535,0.0002647907],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5708418,"threshold_uncertainty_score":0.9996172,"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."}}