{"id":"W2245114686","doi":"10.4230/lipics.stacs.2009.1835","title":"Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Bounded function; Steiner tree problem; Combinatorics; Planar graph; Pathwidth; Mathematics; Genus; Chordal graph; 1-planar graph; Indifference graph; Discrete mathematics; Time complexity; Treewidth; Clique-sum; Polynomial; Graph; Line graph","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.002150599,0.001580635,0.001780588,0.0009029055,0.001479882,0.003593362,0.004500554,0.001933071,0.007170175],"category_scores_gemma":[0.01287731,0.0006312841,0.00197265,0.002659602,0.001174691,0.00851693,0.002673653,0.00332072,0.001237736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003566611,"about_ca_system_score_gemma":0.002349067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003132296,"about_ca_topic_score_gemma":0.004824162,"domain_scores_codex":[0.9979503,0.0004530084,0.0001342935,0.0004382321,0.0005414923,0.0004827327],"domain_scores_gemma":[0.9898122,0.006326037,0.0005910421,0.002473841,0.000434682,0.0003621376],"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.001996503,0.0005169633,0.004269623,0.001058898,0.0002436923,0.0002383756,0.001269737,0.5445245,0.01203258,0.1632836,0.017571,0.2529946],"study_design_scores_gemma":[0.0001801729,0.0001364773,0.0004729432,0.00004784644,0.0001153599,0.000236617,0.0002354941,0.8486695,0.005978796,0.1389488,0.004952426,0.00002559758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.184388,0.001449847,0.7960003,0.002373332,0.0001547469,0.0003890979,0.001171011,0.003478484,0.01059509],"genre_scores_gemma":[0.6457407,0.0009323612,0.3461587,0.0003160112,0.0001513893,0.0003722486,0.002337919,0.0004154257,0.003575115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007170175,"threshold_uncertainty_score":0.02587765,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01680353275891705,"score_gpt":0.2479081749960707,"score_spread":0.2311046422371536,"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."}}