{"id":"W4389115885","doi":"10.48550/arxiv.2311.15346","title":"A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Maximum cut; Mathematics; Hyperplane; Combinatorics; Semidefinite programming; Duality (order theory); Generalization; Extension (predicate logic); Approximation algorithm; Linear programming relaxation; Relaxation (psychology); Discrete mathematics; Algorithm; Linear programming; Mathematical optimization; Computer science; Graph; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001881401,0.001066892,0.001117875,0.0009394854,0.000730195,0.001559915,0.002367099,0.001561021,0.00494866],"category_scores_gemma":[0.005147165,0.0005389875,0.001103749,0.00148662,0.001260436,0.002444705,0.002191105,0.00290356,0.0006858586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002050826,"about_ca_system_score_gemma":0.002011083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002629216,"about_ca_topic_score_gemma":0.003075127,"domain_scores_codex":[0.99867,0.0004453914,0.0000457155,0.0003135923,0.000338069,0.0001872284],"domain_scores_gemma":[0.9988814,0.0005608762,0.0001010243,0.0002191792,0.0001432636,0.00009432258],"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.0001716475,0.0002070505,0.0006936929,0.0001344214,0.00005665594,0.0001124382,0.0001289822,0.5746633,0.002852071,0.3063326,0.006887174,0.1077599],"study_design_scores_gemma":[0.00002308735,0.00002968079,0.00005700518,0.00001392317,0.000006498841,0.00003932999,0.00001366827,0.9420607,0.0006978842,0.05480055,0.00225084,0.000006749513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01348354,0.0001345179,0.9785771,0.000418069,0.00007419473,0.00009585712,0.00006786348,0.0002255337,0.006923246],"genre_scores_gemma":[0.2359516,0.0002333404,0.7553005,0.0003791507,0.0001045145,0.0003089226,0.0003589848,0.0002079273,0.00715499],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00494866,"threshold_uncertainty_score":0.01655489,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09324186680180548,"score_gpt":0.2106296667674288,"score_spread":0.1173877999656233,"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."}}