{"id":"W6947992690","doi":"10.4230/lipics.icalp.2025.20","title":"Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Approximation algorithm; Rounding; Graph; Set cover problem; Strength of a graph; Set (abstract data type); Graph theory; Connected dominating set; Network planning and design; Graph algorithms","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001432655,0.000427715,0.0005352401,0.000388059,0.0008779722,0.0006990777,0.0009418864,0.0002402142,0.000003156947],"category_scores_gemma":[0.0001564781,0.0004116562,0.0002463341,0.0009357026,0.0002065337,0.001752481,0.0003887336,0.0003263403,0.000004076978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008956942,"about_ca_system_score_gemma":0.0001306814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002423285,"about_ca_topic_score_gemma":0.00001092706,"domain_scores_codex":[0.9974219,0.00008038471,0.0009143928,0.0004555208,0.0002605532,0.0008672344],"domain_scores_gemma":[0.9975665,0.000742765,0.0003709543,0.0007325637,0.0004228354,0.0001643649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006485818,0.0008926876,0.0009647448,0.002654632,0.001061321,0.000003067121,0.009934898,0.006464809,0.0003568495,0.6561592,0.01967065,0.3011885],"study_design_scores_gemma":[0.002930622,0.000322747,0.0002081878,0.0001333101,0.00004243603,0.0000147362,0.0002232013,0.887803,0.001749016,0.09823181,0.007890867,0.000450082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004255461,0.0001153234,0.9899034,0.000414351,0.001325701,0.002898073,0.0001678301,0.0004280819,0.0004917968],"genre_scores_gemma":[0.06319273,0.00004704155,0.9341657,0.001170399,0.0001438159,0.0007877899,0.0002227127,0.00003236923,0.0002374295],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8813382,"threshold_uncertainty_score":0.9998335,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02941959307669111,"score_gpt":0.2704119662591975,"score_spread":0.2409923731825064,"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."}}