{"id":"W4410951340","doi":"10.1007/s10878-025-01311-5","title":"Approximation algorithms for the total dominating set problem","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Dominating set; Theory of computation; Approximation algorithm; Algorithm; Set (abstract data type); Set cover problem; Mathematics; Computer science; Mathematical optimization; Combinatorics; Graph; Vertex (graph theory)","routes":{"ca_aff":true,"ca_fund":true,"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.00114526,0.0001075633,0.0001917899,0.0001902416,0.0003285662,0.0002955835,0.0006381689,0.00006655326,0.000003409134],"category_scores_gemma":[0.0002609142,0.00007921931,0.0001475243,0.0006385398,0.00003814685,0.0007086944,0.0001093311,0.0001760917,3.476659e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007164902,"about_ca_system_score_gemma":0.0001544065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002633918,"about_ca_topic_score_gemma":6.618588e-8,"domain_scores_codex":[0.9988045,0.0000813569,0.0005189755,0.0001322981,0.0003097621,0.0001531299],"domain_scores_gemma":[0.9980379,0.000548305,0.0004844961,0.0002045686,0.000689861,0.00003488368],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004982819,0.000112286,0.00001040989,0.00003751189,0.00007749363,0.000001171987,0.0004703811,0.4294129,0.00004681998,0.5172089,0.001417309,0.05115505],"study_design_scores_gemma":[0.001412414,0.0001531562,0.00003837309,0.00005770871,0.00003024193,0.00001681085,0.0000535222,0.8790197,0.0004345117,0.1179681,0.0007371232,0.00007833711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001387423,0.0001553687,0.9913399,0.001983714,0.005615396,0.0003642137,0.000001731317,0.00002803907,0.0003729447],"genre_scores_gemma":[0.04395391,0.00003495935,0.9552547,0.0000899024,0.0005218227,0.00002550415,0.000003818816,0.000008176738,0.0001071752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4496068,"threshold_uncertainty_score":0.323047,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01812841277028336,"score_gpt":0.2763227659425915,"score_spread":0.2581943531723082,"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."}}