{"id":"W2415039998","doi":"10.4230/lipics.swat.2016.3","title":"A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hausdorff Center for Mathematics; University of Waterloo","keywords":"Steiner tree problem; Bipartite graph; Combinatorics; Logarithm; Mathematics; Tree (set theory); Constant (computer programming); Discrete mathematics; Linear programming relaxation; Cover (algebra); Set (abstract data type); Upper and lower bounds; Computer science; Algorithm; Graph; Linear programming","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.002882283,0.00159859,0.001546026,0.001483383,0.001181887,0.004669739,0.00278033,0.001721511,0.0103059],"category_scores_gemma":[0.01731386,0.0007304156,0.001326106,0.002460793,0.002717561,0.009932451,0.00391148,0.008753966,0.001448185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003858348,"about_ca_system_score_gemma":0.001213856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008835269,"about_ca_topic_score_gemma":0.001017205,"domain_scores_codex":[0.9978404,0.0005720909,0.00006639528,0.0004216475,0.0006110956,0.0004883993],"domain_scores_gemma":[0.9862332,0.01094745,0.0006195428,0.001082679,0.000434929,0.0006821694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009687118,0.0005323128,0.00250774,0.0009759679,0.0001231839,0.0003585472,0.0005939429,0.2467535,0.01276213,0.6366108,0.0184693,0.0793438],"study_design_scores_gemma":[0.00004176739,0.0000843302,0.0006602972,0.00009643025,0.00006005058,0.0002757478,0.0001119516,0.4622404,0.003032538,0.5274619,0.005909371,0.00002522317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.163095,0.005455359,0.7485256,0.008495262,0.0004933371,0.0001411407,0.0011001,0.001072286,0.07162186],"genre_scores_gemma":[0.8360568,0.003955628,0.145926,0.001385851,0.0005738601,0.0002577054,0.001007558,0.0008104889,0.01002609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0103059,"threshold_uncertainty_score":0.0344767,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04235837561616695,"score_gpt":0.2944877939420583,"score_spread":0.2521294183258914,"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."}}