Parameterized algorithms for \(d\)-hitting set: the weighted case

DOI10.1016/j.tcs.2010.01.001zbMath1192.68824OpenAlexW2003278864MaRDI QIDQ964386

Henning Fernau

Publication date: 15 April 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.001

zbMATH Keywords

parameterized algorithmshitting set problemssearch tree algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (8)

Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing ⋮ A Multivariate Approach for Weighted FPT Algorithms ⋮ BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES ⋮ A multivariate framework for weighted FPT algorithms ⋮ Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing ⋮ Linear‐time algorithms for eliminating claws in graphs ⋮ Towards optimal and expressive kernelization for \(d\)-hitting set ⋮ A Parameterized Algorithm for Bounded-Degree Vertex Deletion

Cites Work

• Unnamed Item
• Parameterized algorithms for feedback set problems and their duals in tournaments
• An efficient fixed-parameter algorithm for 3-hitting set
• Parameterized algorithmics for linear arrangement problems
• Equivalence between the minimum covering problem and the maximum matching problem
• A theory of diagnosis from first principles
• Characterizing diagnoses and systems
• Constrained weighted matchings and edge coverings in graphs
• A fixed-parameter approach to 2-layer planarization
• Vertex Cover: Further Observations and Further Improvements
• Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
• Two-Layer Planarization: Improving on Parameterized Algorithmics
• Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
• Parameterized Algorithms for Hitting Set: The Weighted Case
• Searching Trees: An Essay
• On efficient fixed-parameter algorithms for weighted vertex cover
• Exact algorithms for finding minimum transversals in rank-3 hypergraphs
• Theoretical Computer Science
• Automata, Languages and Programming
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Parameterized algorithms for \(d\)-hitting set: the weighted case