{"id":"W2963282726","doi":"10.4230/lipics.icalp.2016.74","title":"Approximating Directed Steiner Problems via Tree Embedding","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Approximation algorithm; Directed acyclic graph; Feedback arc set; Directed graph; Discrete mathematics; Vertex (graph theory); Disjoint sets; Embedding; Covering problems; Graph; Computer science; Set (abstract data type); Line graph","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.0009060558,0.001291199,0.001238633,0.001216792,0.0004479134,0.001687025,0.001668119,0.001470506,0.004376278],"category_scores_gemma":[0.007670878,0.0007168275,0.0009761908,0.002316542,0.0005737139,0.004081866,0.001803587,0.00199836,0.00117115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302147,"about_ca_system_score_gemma":0.0009733671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002116928,"about_ca_topic_score_gemma":0.003295666,"domain_scores_codex":[0.9989691,0.0003399944,0.00006036432,0.000234287,0.0002592015,0.000137026],"domain_scores_gemma":[0.9974945,0.001653866,0.00020799,0.0003347681,0.0001996604,0.0001093247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002362408,0.0001448374,0.001667541,0.000409693,0.0001023863,0.0001347715,0.0001489606,0.792086,0.001638809,0.0583241,0.01276278,0.132344],"study_design_scores_gemma":[0.00002170416,0.0000383303,0.0001444537,0.00002743165,0.00001256631,0.00004938287,0.00004144202,0.9423939,0.0003663695,0.05430799,0.002590632,0.000005868218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07121268,0.002939123,0.9087631,0.001023234,0.000199218,0.0001346291,0.0009397403,0.001433485,0.0133548],"genre_scores_gemma":[0.4688536,0.00260776,0.5168105,0.0003407479,0.0001626958,0.0002653571,0.003788364,0.0004098107,0.006761129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004376278,"threshold_uncertainty_score":0.01464015,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01862077904121224,"score_gpt":0.2484985533400094,"score_spread":0.2298777742987972,"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."}}