{"id":"W6967458180","doi":"10.4230/lipics.approx/random.2023.14","title":"Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Steiner tree problem; Partition (number theory); Constant (computer programming); Randomized algorithm; Generalization; Approximation algorithm; Graph; Set (abstract data type); Network planning and design; Undirected graph","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.0009490837,0.0003939764,0.0006268443,0.0002570489,0.0003898731,0.0003163385,0.0008700575,0.0001513845,0.00001245598],"category_scores_gemma":[0.00006807434,0.0003178521,0.0001807335,0.001020004,0.0002951444,0.00104663,0.0003834827,0.0001986859,0.0000176808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003228383,"about_ca_system_score_gemma":0.0001160629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001202439,"about_ca_topic_score_gemma":0.0000105025,"domain_scores_codex":[0.9973577,0.00005227952,0.0009390584,0.0003591136,0.0004259529,0.0008659225],"domain_scores_gemma":[0.9975051,0.0007907628,0.0004503472,0.0006786048,0.0003844406,0.0001907545],"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.002629388,0.001518841,0.01894746,0.005407859,0.002791764,0.00009881083,0.0378343,0.01871203,0.0003861662,0.5148927,0.05764626,0.3391344],"study_design_scores_gemma":[0.005837636,0.001143929,0.0008744319,0.0005552626,0.0000868662,0.0002164384,0.0009099095,0.9455326,0.0016571,0.02329676,0.0190275,0.0008615439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02919469,0.00004719424,0.966928,0.0002550196,0.000421904,0.001836902,0.000340354,0.0004011286,0.0005748206],"genre_scores_gemma":[0.1101695,0.00007754318,0.8876922,0.0004953119,0.0001890136,0.0005052547,0.0002288428,0.00006438763,0.0005779997],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9268206,"threshold_uncertainty_score":0.9999273,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0399989508806633,"score_gpt":0.2908798143270963,"score_spread":0.250880863446433,"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."}}