{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006569151,0.0004218899,0.0006455558,0.00007605119,0.0004351631,0.0003686343,0.0003646878,0.0005679536,0.000004011404],"category_scores_gemma":[0.00004170047,0.0003536943,0.0003158115,0.00003945989,0.0002695265,0.00008183793,0.0001257148,0.0003827787,0.000001126235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006029823,"about_ca_system_score_gemma":0.0002520952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001458515,"about_ca_topic_score_gemma":9.533321e-7,"domain_scores_codex":[0.9982361,0.000006782397,0.0005612029,0.000523945,0.0003055616,0.0003663639],"domain_scores_gemma":[0.9982724,0.0005827131,0.0004631458,0.0003624888,0.0002154273,0.000103887],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004211876,0.0000139935,2.706033e-8,0.0008987974,0.0003076029,1.276403e-7,0.004550778,0.00003945725,0.0001769239,0.9781339,0.006545586,0.009290672],"study_design_scores_gemma":[0.008247589,0.0004768737,1.688891e-8,0.001284891,0.0004632299,0.000008510178,0.001825787,0.1120012,0.002516726,0.7858658,0.08588011,0.001429279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005799136,0.00001720387,0.8648281,0.0002201196,0.0001582416,0.00459175,0.0003308617,0.0002555008,0.1295402],"genre_scores_gemma":[0.0001233438,0.00001528475,0.8198383,0.0002758473,0.0001891004,0.001014127,0.0002168686,0.00006424177,0.1782628],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1922681,"threshold_uncertainty_score":0.9998915,"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."}}