{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001164379,0.0004932466,0.0006221729,0.0006512228,0.0004948887,0.0007373314,0.001488023,0.0002683275,0.000009937354],"category_scores_gemma":[0.0001514605,0.0004906746,0.0004000049,0.0008764027,0.000136114,0.003000846,0.0002428398,0.0003987584,0.00004277727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001762896,"about_ca_system_score_gemma":0.0001227843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002407417,"about_ca_topic_score_gemma":0.00004049243,"domain_scores_codex":[0.9966898,0.00005426673,0.00123063,0.0004993204,0.0004847775,0.001041208],"domain_scores_gemma":[0.9978512,0.0002515508,0.0005005183,0.0009361731,0.0002619829,0.0001985643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006052461,0.004796178,0.008479201,0.002522693,0.0005010013,0.00001242611,0.03315213,0.001145204,0.001702001,0.3338261,0.02173698,0.5915208],"study_design_scores_gemma":[0.008618014,0.00126079,0.00414807,0.0003502699,0.00004273178,0.00008470002,0.0003314497,0.7954916,0.003821347,0.0930536,0.09111892,0.001678484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2748477,0.0001120063,0.7159146,0.001164269,0.0009468906,0.003983378,0.0003840588,0.0005483934,0.00209876],"genre_scores_gemma":[0.8253362,0.00002643671,0.1722381,0.001130668,0.0001771859,0.0004387354,0.0004585829,0.00004158915,0.0001524668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7943464,"threshold_uncertainty_score":0.9997545,"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."}}