{"id":"W1986446280","doi":"10.1016/j.disopt.2012.05.002","title":"Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Clique problem; Clique; Combinatorics; Approximation algorithm; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Time complexity; Integer (computer science); Branch and bound; Mathematical optimization; Discrete mathematics; Algorithm; Chordal graph; Computer science; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.0006203407,0.0001182558,0.0001867827,0.0001844111,0.0002853432,0.0001226843,0.0004862555,0.00005117041,0.00002214024],"category_scores_gemma":[0.00001934861,0.00009084869,0.0001552613,0.001187603,0.00007063785,0.0009961926,0.0001097323,0.00006582205,7.796485e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001742505,"about_ca_system_score_gemma":0.00001883942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003714985,"about_ca_topic_score_gemma":0.00001039688,"domain_scores_codex":[0.9989417,0.0000769939,0.0002799813,0.0002326934,0.0001915345,0.0002771401],"domain_scores_gemma":[0.9990117,0.0001096084,0.0001897506,0.0004716793,0.0001439231,0.00007334605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007317036,0.0001425496,0.0006800777,0.00002263011,0.0003587156,2.304355e-7,0.001748594,0.7772338,0.00001643919,0.06157649,0.00002929017,0.1581839],"study_design_scores_gemma":[0.0001582351,0.00005109292,0.0007612508,0.000007965163,0.0002024628,0.000001385805,0.0000862766,0.9956384,0.000224166,0.002581936,0.0001597091,0.0001271401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002466929,0.000104265,0.9985096,0.0001756937,0.0001660354,0.0003654426,0.00003802273,0.00007906991,0.0003152119],"genre_scores_gemma":[0.05510808,0.00002646655,0.9443288,0.00007708454,0.00009315988,0.0001248001,0.0002002288,0.00001113229,0.00003020297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2184046,"threshold_uncertainty_score":0.3704702,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02307915925681601,"score_gpt":0.2736800363920509,"score_spread":0.2506008771352348,"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."}}