{"id":"W1580605208","doi":"10.1109/wswan.2015.7210302","title":"Hybrid local search approximation algorithm for solving the capacitated Max-K-cut problem","year":2015,"lang":"en","type":"article","venue":"","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Local search (optimization); Approximation algorithm; Vertex (graph theory); Algorithm; Maximum cut; Computer science; Search algorithm; Mathematics; Mathematical optimization; Theoretical computer science; Graph","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.0008554176,0.0006850176,0.001199636,0.0008176492,0.0004748364,0.000784614,0.001946848,0.001056424,0.00343356],"category_scores_gemma":[0.002306966,0.0003681049,0.0006106808,0.001386392,0.0004740425,0.001314711,0.0007720322,0.001074994,0.0008562339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008268373,"about_ca_system_score_gemma":0.001118703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004059251,"about_ca_topic_score_gemma":0.004341955,"domain_scores_codex":[0.9994652,0.0001563121,0.00002412959,0.00008554895,0.0002001621,0.00006865195],"domain_scores_gemma":[0.9992442,0.0003992309,0.00007125336,0.0000809089,0.0001587401,0.0000456319],"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.000287449,0.000141409,0.0007291051,0.000163226,0.00006157909,0.00007076005,0.00007984026,0.8263977,0.003288013,0.01268333,0.00326227,0.1528353],"study_design_scores_gemma":[0.00001817874,0.00002734332,0.00005270689,0.000004111679,0.000005959555,0.0000318329,0.0000115466,0.9970641,0.0005785584,0.00175414,0.0004475198,0.000004082047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01096726,0.0002607409,0.986666,0.00007006731,0.00002256751,0.00003539499,0.00002839333,0.000591071,0.001358494],"genre_scores_gemma":[0.3419293,0.0002900691,0.6535426,0.0001078332,0.00003821172,0.0002626111,0.0002830565,0.0001850518,0.003361323],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004059251,"threshold_uncertainty_score":0.01148641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04446632716159683,"score_gpt":0.2692381515591262,"score_spread":0.2247718243975294,"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."}}