Parameterized Algorithms for Hitting Set: The Weighted Case

DOI10.1007/11758471_32MaRDI QIDQ3434568zbMATH OpenOpenAlexFDO

Authors Henning Fernau

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758471_32

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Parameterized algorithms for d-hitting set: the weighted case
• Parameterized algorithmics for d-HITTING SET
• Parameterized approximation algorithms for hitting set
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set
• An efficient fixed-parameter algorithm for 3-hitting set

Cited in

(15)

• Multiple hypernode hitting sets and smallest two-cores with targets
• The union of minimal hitting sets: parameterized combinatorial bounds and counting
• Iterative compression and exact algorithms
• Improved FPT algorithm for feedback vertex set problem in bipartite tournament
• Faster parameterized algorithms for two vertex deletion problems
• Parameterized approximation algorithms for hitting set
• Parameterized algorithmics for d-HITTING SET
• Iterative Compression and Exact Algorithms
• Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
• Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
• Fixed-Parameter Algorithms for Cluster Vertex Deletion
• Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set
• Parameterized algorithms for d-hitting set: the weighted case
• Fixed-parameter algorithms for cluster vertex deletion

This page was built for publication: Parameterized Algorithms for Hitting Set: The Weighted Case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434568)