{"id":"W2039826584","doi":"10.3390/a6010043","title":"Computational Study on a PTAS for Planar Dominating Set Problem","year":2013,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dominating set; Mathematics; Polynomial-time approximation scheme; Approximation algorithm; Planar; Planar graph; Combinatorics; Planar straight-line graph; Bounded function; Computational complexity theory; Graph; Independent set; Discrete mathematics; Algorithm; Pathwidth; Computer science; Line graph; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048876,0.0001279994,0.0001458703,0.0001431547,0.000220295,0.0001592194,0.0006971774,0.00002974012,0.0000134933],"category_scores_gemma":[0.00005899082,0.0001114268,0.00004800006,0.0003211571,0.00004066521,0.0004102927,0.000122439,0.0001379889,0.0001689007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003814218,"about_ca_system_score_gemma":0.00003781987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002022253,"about_ca_topic_score_gemma":0.00000143316,"domain_scores_codex":[0.998534,0.00009510305,0.0001970593,0.0004206867,0.0004042549,0.0003488626],"domain_scores_gemma":[0.9986569,0.0006569203,0.00006569775,0.000329926,0.0001960402,0.00009447357],"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.00005708538,0.001503674,0.002047442,0.00006174582,0.0002287564,0.00007868868,0.01027275,0.01784282,0.0003071375,0.2812553,0.008014471,0.6783301],"study_design_scores_gemma":[0.001601043,0.001289097,0.003506078,0.0000192567,0.000003900957,0.00001682856,0.0006433557,0.5759477,0.0001438776,0.4161167,0.0004497764,0.0002624222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02576044,0.00001476567,0.970749,0.0007057019,0.00009903715,0.001853217,0.00001406584,0.0001415304,0.000662304],"genre_scores_gemma":[0.4330056,3.635197e-7,0.5656673,0.000211779,0.00007611669,0.0006773857,0.0000126897,0.00001756032,0.0003312173],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6780677,"threshold_uncertainty_score":0.4543851,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03896625998283992,"score_gpt":0.3349611390252531,"score_spread":0.2959948790424132,"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."}}