{"id":"W2063687001","doi":"10.1007/s10878-012-9526-3","title":"Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Approximation algorithm; Disjoint sets; Mathematics; Convexity; Theory of computation; Combinatorics; Function (biology); Range (aeronautics); Relaxation (psychology); Algorithm; Discrete mathematics","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.005055401,0.00331363,0.004996075,0.004048035,0.002263114,0.005944123,0.009418166,0.004816376,0.0209025],"category_scores_gemma":[0.02073639,0.002387791,0.003399048,0.008623237,0.002102787,0.01426122,0.00574629,0.006423801,0.003122985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005435118,"about_ca_system_score_gemma":0.005617274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009274373,"about_ca_topic_score_gemma":0.01584958,"domain_scores_codex":[0.9965441,0.001151572,0.0002049748,0.0007494864,0.0007845709,0.0005653531],"domain_scores_gemma":[0.9887455,0.007246548,0.00076785,0.001863533,0.0007832446,0.0005932749],"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.001212897,0.0008852835,0.001922273,0.0006496259,0.0002164587,0.0001237694,0.0004455543,0.5756463,0.001672986,0.1432893,0.02606028,0.2478752],"study_design_scores_gemma":[0.000113828,0.00006193362,0.0002639772,0.00003120369,0.00004804032,0.00005743047,0.00006800891,0.9013087,0.00055018,0.09514529,0.002327117,0.00002420314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03737251,0.001698332,0.9441752,0.001517671,0.0002355283,0.0003303583,0.001028486,0.002103504,0.01153828],"genre_scores_gemma":[0.1806546,0.0009278738,0.8035071,0.00049897,0.0003254975,0.0005365075,0.00311549,0.0009465021,0.009487339],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0209025,"threshold_uncertainty_score":0.06992579,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02017153551588397,"score_gpt":0.250768736552305,"score_spread":0.230597201036421,"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."}}