{"id":"W2015423869","doi":"10.1007/s10107-009-0299-0","title":"New geometry-inspired relaxations and algorithms for the metric Steiner tree problem","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Bipartite graph; Metric (unit); Linear programming relaxation; Combinatorics; Approximation algorithm; Upper and lower bounds; Algorithm; Relaxation (psychology); Schema (genetic algorithms); Discrete mathematics; Linear programming; Computer science; 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.002770806,0.001876541,0.001850362,0.001836453,0.00120534,0.003156514,0.003588762,0.002386371,0.007862358],"category_scores_gemma":[0.01297039,0.001268653,0.002074118,0.003155962,0.002020787,0.006619355,0.004302032,0.008053938,0.001471018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002303216,"about_ca_system_score_gemma":0.001571037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001475815,"about_ca_topic_score_gemma":0.002153214,"domain_scores_codex":[0.998174,0.0007510717,0.00008235401,0.0002754948,0.0005525758,0.0001644835],"domain_scores_gemma":[0.9961165,0.00230366,0.0004067176,0.0004948,0.0003805087,0.0002978617],"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.0002242256,0.0002658905,0.0004018966,0.000421903,0.00008290912,0.00008819396,0.0002930022,0.1881927,0.002159339,0.6698818,0.02744698,0.1105412],"study_design_scores_gemma":[0.00007479238,0.0000719716,0.0001898079,0.00007081525,0.00003115415,0.0001046449,0.00008417109,0.4772522,0.0006403183,0.5059269,0.01551629,0.00003694013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01321498,0.001719398,0.9583575,0.002575735,0.000457454,0.0001164841,0.0002942572,0.0002841464,0.02298005],"genre_scores_gemma":[0.1246271,0.002411705,0.8566691,0.001013145,0.001101576,0.0004752729,0.0008842272,0.0005787273,0.01223925],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007862358,"threshold_uncertainty_score":0.02630222,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03784171705136553,"score_gpt":0.2851208739396493,"score_spread":0.2472791568882838,"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."}}