{"id":"W1976459503","doi":"10.1007/s00493-006-0016-z","title":"Network Design Via Iterative Rounding Of Setpair Relaxations","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Rounding; Mathematics; Combinatorics; Linear programming relaxation; Vertex (graph theory); Omega; Approximation algorithm; Discrete mathematics; Relaxation (psychology); Linear programming; Integer (computer science); Network planning and design; Vertex connectivity; Undirected graph; Graph; Mathematical optimization; Computer science","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.002232999,0.001661625,0.001486414,0.0012381,0.0007842761,0.002106786,0.002451098,0.001558279,0.01151084],"category_scores_gemma":[0.008071011,0.0009554601,0.001338929,0.001396092,0.0009705945,0.002672438,0.002552279,0.003108945,0.001541175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001293196,"about_ca_system_score_gemma":0.001047192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001236913,"about_ca_topic_score_gemma":0.00187334,"domain_scores_codex":[0.9984617,0.0007135163,0.00006099731,0.000230239,0.000331615,0.0002020222],"domain_scores_gemma":[0.9967011,0.002214716,0.0002006475,0.0004459297,0.0003154224,0.0001221246],"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.0002047172,0.0001434427,0.0002757476,0.000274266,0.00006096581,0.00008704007,0.0002116029,0.7628262,0.003304318,0.1129804,0.006897138,0.1127341],"study_design_scores_gemma":[0.00003950041,0.00009771458,0.00005356937,0.00004321824,0.00002184018,0.00004744807,0.00007724708,0.9229692,0.001675604,0.07238744,0.002571577,0.00001552334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01417356,0.0001959481,0.9720081,0.0002310815,0.00009619781,0.0001070008,0.00009831337,0.00030684,0.01278292],"genre_scores_gemma":[0.3112531,0.0003955441,0.6797051,0.0002342927,0.0001114753,0.0004683877,0.0003458321,0.000335013,0.007151236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01151084,"threshold_uncertainty_score":0.03850764,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02367530720691067,"score_gpt":0.2316478668460641,"score_spread":0.2079725596391535,"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."}}