{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002897901,0.0001172474,0.0001749007,0.0000930883,0.0002741073,0.00007838882,0.0006060371,0.00004907018,0.000009325518],"category_scores_gemma":[0.00002888054,0.0001181419,0.00007021687,0.00107727,0.00006006178,0.0003257194,0.0001737944,0.0001296919,0.00001416229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006817431,"about_ca_system_score_gemma":0.0000453693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003763041,"about_ca_topic_score_gemma":0.000001395704,"domain_scores_codex":[0.9988832,0.0001320351,0.000265245,0.000248146,0.0002189627,0.0002524278],"domain_scores_gemma":[0.9988989,0.0003572599,0.0001589307,0.0004212453,0.0001189532,0.00004472723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002211102,0.0001277732,0.0006677266,0.000005700066,0.00001072249,0.000006174886,0.0001857278,0.002847337,0.00008642695,0.9864533,0.007499187,0.002107737],"study_design_scores_gemma":[0.0002604678,0.0001582088,0.002639405,0.00002601967,0.000006304192,0.000008220586,0.000005599462,0.07740851,0.0006690451,0.9153274,0.003321305,0.0001695408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009395464,0.0003247337,0.9940106,0.0002690574,0.0007191065,0.0001416428,9.517996e-7,0.0001491694,0.003445172],"genre_scores_gemma":[0.8399587,0.000003987783,0.1596082,0.00005401278,0.00007833574,0.00001598445,0.000002852886,0.000006914194,0.0002710375],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8390192,"threshold_uncertainty_score":0.4817685,"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."}}