{"id":"W3211932688","doi":"10.1016/j.orl.2023.03.008","title":"On a partition LP relaxation for min-cost 2-node connected spanning subgraphs","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear programming relaxation; Spanning tree; Combinatorics; Partition (number theory); Mathematics; Minimum spanning tree; Relaxation (psychology); Linear programming; Graph partition; Minimum degree spanning tree; Greedy algorithm; Graph factorization; Discrete mathematics; Graph; Mathematical optimization; Line graph; Graph power","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.002150654,0.002760605,0.002188928,0.001234724,0.0009968356,0.003050712,0.002938043,0.003099219,0.01774362],"category_scores_gemma":[0.009376697,0.001244015,0.001688591,0.002626975,0.001605756,0.00411869,0.003362823,0.00476005,0.001606933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002241093,"about_ca_system_score_gemma":0.001679157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005416098,"about_ca_topic_score_gemma":0.005861395,"domain_scores_codex":[0.9987317,0.000535802,0.00003249619,0.0002260433,0.0002448852,0.0002290953],"domain_scores_gemma":[0.9958352,0.003417084,0.0001529341,0.00018947,0.0002165011,0.0001887589],"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.000460526,0.000334519,0.0005432165,0.0008142775,0.0001099471,0.0002581167,0.0003555572,0.7739213,0.002436728,0.1283103,0.0277461,0.06470953],"study_design_scores_gemma":[0.00007697061,0.00009753075,0.0002639254,0.0001079153,0.00004742293,0.00008230146,0.0001826425,0.8724577,0.0005152902,0.1212385,0.00491306,0.00001667881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04918736,0.002231292,0.8843791,0.003722883,0.000455269,0.0004283053,0.00132723,0.0004409274,0.05782755],"genre_scores_gemma":[0.4150538,0.002822651,0.53989,0.002129568,0.0009919432,0.001158005,0.002465255,0.001163417,0.03432534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01774362,"threshold_uncertainty_score":0.0593583,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1313485043481517,"score_gpt":0.3851309175006559,"score_spread":0.2537824131525043,"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."}}