{"id":"W2002849997","doi":"10.1007/s10878-015-9880-z","title":"An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Beijing University of Technology; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Rounding; Semidefinite programming; Randomized rounding; Univariate; Approximation algorithm; Maximum cut; Theory of computation; Linear programming; Bivariate analysis; Mathematics; Partition (number theory); Semidefinite embedding; Mathematical optimization; Algorithm; Graph partition; Graph; Computer science; Discrete mathematics; Combinatorics; Quadratically constrained quadratic program; Quadratic programming","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.001378576,0.001851067,0.002031843,0.0009260456,0.0008907044,0.00242195,0.00190209,0.001736865,0.01396683],"category_scores_gemma":[0.004516654,0.0007699229,0.0009599536,0.00161361,0.0008682565,0.002115102,0.002182842,0.002167888,0.001988652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001320511,"about_ca_system_score_gemma":0.001914208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003321556,"about_ca_topic_score_gemma":0.005657603,"domain_scores_codex":[0.9991135,0.0002545684,0.00003249578,0.0001635931,0.0002458057,0.0001900222],"domain_scores_gemma":[0.9986947,0.0008555208,0.00008806071,0.0001555879,0.0001363877,0.00006969139],"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.0004129301,0.0002453577,0.0003624276,0.000258796,0.00005986995,0.0001303785,0.00009266916,0.7651382,0.002226861,0.06566601,0.01480135,0.1506052],"study_design_scores_gemma":[0.00004880316,0.00004608079,0.0000405675,0.00002636754,0.000007883885,0.00003638137,0.00002706905,0.9762659,0.0005210826,0.02154843,0.001423125,0.0000083389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01112843,0.0003756589,0.9760607,0.0003253538,0.0001393851,0.0001042578,0.0001907789,0.0006151532,0.0110602],"genre_scores_gemma":[0.2131635,0.0003109204,0.7779811,0.0003428893,0.00009634674,0.0003552846,0.0005279041,0.0003710945,0.006850943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01396683,"threshold_uncertainty_score":0.04672372,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04340661387300668,"score_gpt":0.2811249968913931,"score_spread":0.2377183830183865,"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."}}