Multiple hypernode hitting sets and smallest two-cores with targets
From MaRDI portal
Publication:1041434
DOI10.1007/s10878-009-9234-9zbMath1180.90265OpenAlexW4242898268MaRDI QIDQ1041434
Publication date: 2 December 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9234-9
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (2)
Parameterized complexity of max-lifetime target coverage in wireless sensor networks ⋮ Parameterizations of hitting set of bundles and inverse scope
Uses Software
Cites Work
- Unnamed Item
- Chordless paths through three vertices
- Computational aspects of monotone dualization: a brief survey
- Parameterized Algorithms for Hitting Set: The Weighted Case
- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
- Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
- The steiner problem in graphs
This page was built for publication: Multiple hypernode hitting sets and smallest two-cores with targets