{"id":"W1558498035","doi":"10.4230/lipics.icalp.2016.74","title":"Approximating Directed Steiner Problems via Tree Embedding","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; McGill University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Steiner tree problem; Mathematics; Logarithm; Modulo; Approximation algorithm; Binary logarithm; Tree (set theory); Matching (statistics); Time complexity; Discrete mathematics; Hierarchy","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009505008,0.00127244,0.001263231,0.001260297,0.0004414132,0.001751803,0.001965862,0.001675016,0.004065347],"category_scores_gemma":[0.00831092,0.0006830036,0.001062767,0.002655318,0.0005968306,0.004614896,0.001986685,0.002079336,0.001093254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001215097,"about_ca_system_score_gemma":0.0008696168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00183364,"about_ca_topic_score_gemma":0.002783153,"domain_scores_codex":[0.9988742,0.0003868839,0.00006955233,0.0002529836,0.0002792678,0.0001371132],"domain_scores_gemma":[0.9971455,0.001891265,0.0002466819,0.000387618,0.0002099625,0.0001191153],"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.0002277222,0.0001612388,0.001877904,0.0004336381,0.00009634284,0.0001550993,0.0001592441,0.7923874,0.001737696,0.06016923,0.0101571,0.1324374],"study_design_scores_gemma":[0.00002319948,0.00004663241,0.0001566796,0.00002543422,0.00001331334,0.00005793598,0.00004156303,0.9429805,0.0004048429,0.05363368,0.002609796,0.000006471519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06366502,0.002593448,0.9194499,0.0009566642,0.0001741194,0.000130417,0.0007501493,0.001189639,0.01109058],"genre_scores_gemma":[0.4558451,0.002721694,0.531646,0.0003463693,0.0001709723,0.0002668599,0.003170373,0.0003327748,0.005499859],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004065347,"threshold_uncertainty_score":0.01359987,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09702573959776858,"score_gpt":0.1924085915130823,"score_spread":0.09538285191531376,"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."}}