{"id":"W2042788891","doi":"10.1016/j.orl.2010.09.004","title":"Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Linear programming relaxation; Hypergraph; Mathematics; Upper and lower bounds; Combinatorics; Bounded function; Relaxation (psychology); Linear programming; Tree (set theory); Approximation algorithm; Discrete mathematics; Algorithm; Mathematical analysis","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.006121011,0.004988124,0.003982459,0.004509189,0.003794858,0.009028651,0.006590199,0.004958534,0.0295992],"category_scores_gemma":[0.03240124,0.002810975,0.006105792,0.007035347,0.007093543,0.02443766,0.01268909,0.02719442,0.004894295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006420056,"about_ca_system_score_gemma":0.003018058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002166858,"about_ca_topic_score_gemma":0.001744033,"domain_scores_codex":[0.9951138,0.0010083,0.0002093441,0.001208979,0.001208315,0.001251266],"domain_scores_gemma":[0.9771386,0.01743046,0.0009420301,0.001597831,0.001428144,0.001462981],"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.0005093071,0.0003359972,0.0008332932,0.001389822,0.0001415593,0.0003442807,0.001005191,0.0208855,0.00500327,0.8779297,0.03680239,0.05481968],"study_design_scores_gemma":[0.00004717759,0.00008598174,0.0006512112,0.0002641452,0.0001524085,0.0002483278,0.0001821574,0.03263289,0.002153597,0.9499666,0.01354448,0.00007100691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07390796,0.03273141,0.5344566,0.04021977,0.006077147,0.0003572938,0.002337915,0.001352807,0.3085592],"genre_scores_gemma":[0.669572,0.0324809,0.2036495,0.01470605,0.01404866,0.001849685,0.002561055,0.003401061,0.05773116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0295992,"threshold_uncertainty_score":0.09901923,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06305174887661538,"score_gpt":0.3385172516865786,"score_spread":0.2754655028099633,"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."}}