{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00379405,0.00223149,0.003213454,0.002248974,0.001418907,0.004420963,0.004823556,0.002561056,0.006005918],"category_scores_gemma":[0.01644396,0.001094359,0.002113735,0.004288648,0.001450781,0.006596043,0.00304012,0.004542878,0.001105013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004157118,"about_ca_system_score_gemma":0.003277801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004353843,"about_ca_topic_score_gemma":0.005780704,"domain_scores_codex":[0.9971586,0.001001594,0.0001318941,0.0005506388,0.0006986131,0.0004586233],"domain_scores_gemma":[0.9890542,0.008201197,0.0005005649,0.001083214,0.0006505189,0.0005103111],"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.001012178,0.0007240938,0.00149396,0.0006575054,0.0002850798,0.0001034708,0.0003093526,0.625087,0.001534458,0.1304384,0.02689917,0.2114553],"study_design_scores_gemma":[0.0001516784,0.00009016351,0.0001896242,0.0000420893,0.0000748409,0.00008398227,0.00006464439,0.8785092,0.0004330313,0.1176585,0.002687627,0.00001467847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03868294,0.003847548,0.9355152,0.003070048,0.0005983345,0.0002510616,0.0007474095,0.001136712,0.01615072],"genre_scores_gemma":[0.4425764,0.003319315,0.5364627,0.001168677,0.0008322254,0.0005825668,0.00223364,0.0006361252,0.01218832],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006005918,"threshold_uncertainty_score":0.0301621,"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."}}