{"id":"W1999969615","doi":"10.5555/1283383.1283410","title":"Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Competitive analysis; Steiner tree problem; Upper and lower bounds; Mathematics; Bounded function; Binary logarithm; Online algorithm; Log-log plot; Discrete mathematics; Asymmetry; Algorithm","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.004223303,0.002465953,0.002191773,0.001847804,0.001948413,0.004340455,0.005665622,0.002451333,0.01156241],"category_scores_gemma":[0.02178982,0.000941598,0.002005607,0.002964892,0.002187731,0.01131661,0.003910492,0.004870716,0.002043352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004116999,"about_ca_system_score_gemma":0.002986626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004111837,"about_ca_topic_score_gemma":0.005151863,"domain_scores_codex":[0.9944161,0.001556581,0.0002130536,0.0007708009,0.001794927,0.001248618],"domain_scores_gemma":[0.977888,0.01700995,0.001107387,0.002138366,0.001161133,0.0006951734],"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.001911134,0.0006469682,0.002905218,0.001021873,0.0002349832,0.0003898827,0.0005000157,0.5126849,0.01863598,0.3257678,0.01707774,0.1182236],"study_design_scores_gemma":[0.0001095838,0.0001859518,0.0006134815,0.0000717798,0.0000912862,0.0002505765,0.0001096006,0.8605524,0.003937277,0.1263028,0.007733704,0.00004149406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1092828,0.008721793,0.8130637,0.005288396,0.0005313186,0.0003257741,0.0008431363,0.001753666,0.06018934],"genre_scores_gemma":[0.6852978,0.006028329,0.292233,0.001387808,0.00117243,0.000612922,0.001371645,0.001248314,0.0106476],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01156241,"threshold_uncertainty_score":0.03868008,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02241062238336079,"score_gpt":0.2883845235798826,"score_spread":0.2659739011965219,"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."}}