{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101478,0.000143461,0.0002361678,0.0001340204,0.0001225408,0.0002074416,0.0001982589,0.0001042825,0.000002659618],"category_scores_gemma":[0.00005722478,0.0001145304,0.00007513716,0.0002351839,0.00002116599,0.000759688,0.00001125478,0.0001627584,2.674583e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002380895,"about_ca_system_score_gemma":0.00006351552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004087226,"about_ca_topic_score_gemma":1.031109e-7,"domain_scores_codex":[0.998863,0.00005923603,0.0004964704,0.00008465983,0.0003059695,0.0001906482],"domain_scores_gemma":[0.9988837,0.00008133126,0.0003066279,0.0001247497,0.0005066656,0.00009694426],"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.00003150684,0.00005139133,0.00002888136,0.00003025881,0.00004682582,0.000001314262,0.0003300216,0.9644042,0.001421644,0.00113144,0.0003225227,0.03219998],"study_design_scores_gemma":[0.00115683,0.0002916508,0.000004597237,0.0000573363,0.0000681361,0.00003431728,0.0001454452,0.9919748,0.00120075,0.003725475,0.001200375,0.0001403438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007429176,0.0001398813,0.9967368,0.00002644291,0.001583874,0.0005304641,0.000003220722,0.0001453009,0.00009111175],"genre_scores_gemma":[0.154745,0.00003353388,0.844399,0.00001134672,0.0007212977,0.00002141704,0.00002247387,0.00004360058,0.000002368402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.154002,"threshold_uncertainty_score":0.4670414,"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."}}