{"id":"W16151075","doi":"10.1007/978-3-642-38768-5_28","title":"An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rounding; Semidefinite programming; Computer science; Semidefinite embedding; Bisection method; Graph; Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Quadratically constrained quadratic program","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.001472107,0.001736206,0.002115678,0.001201038,0.00116303,0.003238864,0.003499259,0.001763151,0.01537695],"category_scores_gemma":[0.005141309,0.0009439677,0.001486497,0.002767288,0.000752953,0.003002536,0.002926516,0.005583424,0.003991508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00172362,"about_ca_system_score_gemma":0.0026177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003077332,"about_ca_topic_score_gemma":0.00523332,"domain_scores_codex":[0.9982269,0.0004312181,0.00008791476,0.0003643766,0.0006377486,0.0002518504],"domain_scores_gemma":[0.99763,0.001084889,0.000130695,0.0005555456,0.0004412193,0.0001575989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008554545,0.00103523,0.0004952998,0.0004996348,0.00009288797,0.0001410107,0.0002505578,0.2851005,0.007332748,0.09164006,0.04545163,0.5671051],"study_design_scores_gemma":[0.0001219924,0.0001106467,0.0001197705,0.00003663653,0.00002236335,0.00007470154,0.00005642491,0.9531086,0.001914536,0.03943757,0.004974737,0.00002199218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01866094,0.0004483912,0.9558161,0.0006524871,0.0003938549,0.0002348079,0.0003827948,0.002696376,0.02071421],"genre_scores_gemma":[0.109174,0.0002855463,0.8773594,0.0004177718,0.0001829824,0.0004162646,0.001109156,0.0006050108,0.01044976],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01537695,"threshold_uncertainty_score":0.05144101,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02390558049323789,"score_gpt":0.276982067702682,"score_spread":0.2530764872094441,"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."}}