{"id":"W2156300926","doi":"10.1007/s00453-011-9503-8","title":"A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Polynomial-time approximation scheme; Approximation algorithm; Vertex (graph theory); Clique graph; Unit disk graph; Clique; Upper and lower bounds; Adjacency matrix; Discrete mathematics; Unit disk; Graph; Line graph; Computer science; Graph power","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.003361037,0.002069936,0.004168251,0.001498945,0.002180944,0.005264469,0.005918504,0.003837006,0.008707983],"category_scores_gemma":[0.01923544,0.001266396,0.002945796,0.002660601,0.00277149,0.007791072,0.007265693,0.005229926,0.001741464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003064379,"about_ca_system_score_gemma":0.003672347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002108656,"about_ca_topic_score_gemma":0.00186352,"domain_scores_codex":[0.9957195,0.001299785,0.0002287464,0.001374239,0.000945325,0.0004324638],"domain_scores_gemma":[0.9897994,0.004859485,0.0009333257,0.002487471,0.001028036,0.0008923328],"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.002301493,0.0005175834,0.001999141,0.0009957452,0.0003818343,0.0002923982,0.0007019124,0.452174,0.01995819,0.372775,0.02392409,0.1239785],"study_design_scores_gemma":[0.0001002497,0.0002028068,0.0002770803,0.00004021843,0.00007408075,0.0001087118,0.0001028941,0.7820788,0.002381448,0.2122253,0.002371656,0.00003677311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06055091,0.0004188852,0.9254929,0.00149613,0.0001836909,0.0003743523,0.0009039464,0.001297015,0.009282144],"genre_scores_gemma":[0.6005288,0.0005383921,0.3842064,0.0006506916,0.0003540078,0.000922405,0.001782361,0.0007511132,0.01026578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008707983,"threshold_uncertainty_score":0.02913105,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08879720214434278,"score_gpt":0.262803065569681,"score_spread":0.1740058634253382,"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."}}