{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002696443,0.001416679,0.001775418,0.001248046,0.001156693,0.002637195,0.003384629,0.002163006,0.007301682],"category_scores_gemma":[0.01542866,0.0008173044,0.001184795,0.002350139,0.001387644,0.00332943,0.002331011,0.002136458,0.0009688908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002846333,"about_ca_system_score_gemma":0.004276153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004313074,"about_ca_topic_score_gemma":0.005347408,"domain_scores_codex":[0.9975756,0.0008793189,0.00008121794,0.0003017785,0.000807421,0.0003546747],"domain_scores_gemma":[0.9912122,0.006778435,0.0003677931,0.0006525046,0.000704014,0.0002849755],"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.0009094432,0.0003473931,0.001724695,0.0004329657,0.0001331971,0.0001179875,0.0002086318,0.7743114,0.004689241,0.09559946,0.01231164,0.1092139],"study_design_scores_gemma":[0.00005781454,0.00005021559,0.0001995514,0.00001346699,0.00002252021,0.00004465181,0.00003104051,0.9706978,0.0004019993,0.02760401,0.0008695076,0.000007510715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04525423,0.0009644039,0.9388779,0.001187297,0.000145869,0.0002625738,0.0002612387,0.0006461116,0.01240042],"genre_scores_gemma":[0.4084664,0.0007882726,0.5818174,0.0005878717,0.000284146,0.0006412001,0.0009366729,0.0005125725,0.005965492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007301682,"threshold_uncertainty_score":0.02442658,"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."}}