{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008410525,0.0005025861,0.0005517677,0.0003887255,0.0005493438,0.0005445779,0.001907962,0.000203554,0.00003869919],"category_scores_gemma":[0.0001670762,0.0003572836,0.0003337714,0.0006586308,0.0001704597,0.002862737,0.0008526907,0.0003216212,0.0001545572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001397797,"about_ca_system_score_gemma":0.00006197705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001353362,"about_ca_topic_score_gemma":0.00001783075,"domain_scores_codex":[0.9963069,0.00006004211,0.001406111,0.0004634449,0.0006720675,0.001091443],"domain_scores_gemma":[0.9972976,0.000344015,0.0006039109,0.001152224,0.0003316218,0.0002706324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007793717,0.0007698891,0.003536782,0.001235145,0.0004646193,0.00001436336,0.0166173,0.0003308454,0.002322198,0.07467748,0.005740976,0.8942125],"study_design_scores_gemma":[0.004527837,0.0003695475,0.0004997989,0.000751317,0.00003568173,0.0001328917,0.0002843199,0.9186072,0.00301568,0.01750545,0.05302197,0.001248323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01983604,0.00004330291,0.9708422,0.0006190373,0.001073024,0.001084124,0.0001355454,0.001059917,0.005306779],"genre_scores_gemma":[0.4287273,0.00003241389,0.5682673,0.0008410543,0.0003845546,0.0003788173,0.0001168459,0.00008975038,0.001161914],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9182763,"threshold_uncertainty_score":0.9998879,"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."}}