{"id":"W4226108027","doi":"10.4230/lipics.icalp.2023.63","title":"An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Bipartite graph; Minor (academic); Constant (computer programming); Linear programming relaxation; Discrete mathematics; Approximation algorithm; Dual (grammatical number); Tree (set theory); Linear programming; Algorithm; Graph; Computer science; Law","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.0009063977,0.002383096,0.001734343,0.001598135,0.001040036,0.003091972,0.003779903,0.002067354,0.01744678],"category_scores_gemma":[0.006635362,0.0008912312,0.002002903,0.003744282,0.000978186,0.008112038,0.003344078,0.002792189,0.005990833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002885459,"about_ca_system_score_gemma":0.002027295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003424302,"about_ca_topic_score_gemma":0.006121255,"domain_scores_codex":[0.9983693,0.0002583199,0.00009657339,0.0004042005,0.0004765474,0.0003951278],"domain_scores_gemma":[0.997124,0.001181271,0.0002645967,0.0009890174,0.0002283693,0.0002127552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001955615,0.0008774355,0.003093254,0.001689964,0.0002852204,0.0005285634,0.0005199873,0.2820841,0.03952285,0.07954151,0.07731846,0.512583],"study_design_scores_gemma":[0.0003830335,0.000243327,0.001054849,0.0001135562,0.0001430441,0.000758146,0.0002948944,0.8313265,0.01269337,0.1336218,0.01930233,0.00006513343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1101675,0.002113107,0.828931,0.0034974,0.0004220095,0.0003957743,0.002974359,0.01423231,0.03726654],"genre_scores_gemma":[0.2964325,0.00144071,0.6816025,0.0006011209,0.0001856732,0.0003401818,0.004775846,0.001505634,0.01311579],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01744678,"threshold_uncertainty_score":0.05836529,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1119947188683434,"score_gpt":0.2181126986295274,"score_spread":0.106117979761184,"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."}}