{"id":"W4406142010","doi":"10.1137/1.9781611978322.48","title":"Parameterized Approximation for Capacitated <i>d</i>-Hitting Set with Hard Capacities","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"European Commission; Department of Science and Technology, Ministry of Science and Technology, India; York University; New York University Shanghai","keywords":"Parameterized complexity; Combinatorics; Set cover problem; Vertex (graph theory); Mathematics; Set (abstract data type); Integer (computer science); Vertex cover; Function (biology); Cover (algebra); Discrete mathematics; Minimum weight; Mathematical optimization; Approximation algorithm; Graph; Computer science","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.001218283,0.001950454,0.002550978,0.001051146,0.0007036965,0.003264669,0.003920927,0.002025925,0.01196628],"category_scores_gemma":[0.006735448,0.0008082896,0.001237662,0.003694027,0.0009984481,0.004235773,0.002410421,0.002401358,0.001454351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004005266,"about_ca_system_score_gemma":0.001967242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005647577,"about_ca_topic_score_gemma":0.004842847,"domain_scores_codex":[0.9987691,0.0003108278,0.00005075416,0.0003048574,0.0002306286,0.0003338192],"domain_scores_gemma":[0.9968143,0.002260737,0.000207922,0.0003153803,0.0001354146,0.0002661484],"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.0003558854,0.0001869518,0.0008825864,0.0003744148,0.00008685789,0.0001411754,0.0001242709,0.8801445,0.0009286536,0.04340609,0.01342412,0.05994446],"study_design_scores_gemma":[0.00002742243,0.00006735141,0.0001534793,0.00003205907,0.0000142287,0.00008013738,0.00004764212,0.9523706,0.0003634437,0.04518571,0.001646218,0.0000116892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1126651,0.003171625,0.8448052,0.001918732,0.0002280623,0.0003273351,0.00277884,0.002558354,0.03154685],"genre_scores_gemma":[0.7261938,0.001480607,0.2501713,0.0005883389,0.0002097441,0.0005691518,0.003776795,0.0008050459,0.01620517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01196628,"threshold_uncertainty_score":0.04003119,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09124989470558423,"score_gpt":0.251023487810218,"score_spread":0.1597735931046338,"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."}}