{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001365721,0.001821016,0.001252525,0.0009535771,0.001045071,0.002218408,0.002987326,0.001906137,0.01373548],"category_scores_gemma":[0.005786506,0.001111617,0.001706165,0.002342272,0.001288048,0.004946481,0.002311656,0.002342018,0.001941525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003310241,"about_ca_system_score_gemma":0.002661609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003578796,"about_ca_topic_score_gemma":0.005926711,"domain_scores_codex":[0.9982892,0.0004421022,0.0000947193,0.0005606317,0.0003624551,0.0002508528],"domain_scores_gemma":[0.9973674,0.001575265,0.0002463019,0.0005572569,0.0001570185,0.0000966228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000395619,0.0002741652,0.0007198941,0.0008166544,0.0001199909,0.0001624368,0.0002450989,0.6053223,0.003018685,0.1937674,0.0225737,0.172584],"study_design_scores_gemma":[0.000196627,0.00007415747,0.000175569,0.00006483742,0.00003813202,0.0001251697,0.00005896998,0.7265521,0.001198494,0.2629936,0.008499606,0.00002285255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02541958,0.0008679908,0.9543445,0.001272906,0.0001378353,0.0004115518,0.0008004,0.0019566,0.01478871],"genre_scores_gemma":[0.2499296,0.0008614853,0.7354329,0.0004895178,0.0001451599,0.0009112076,0.001987856,0.0005563638,0.009685972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01373548,"threshold_uncertainty_score":0.04594976,"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."}}