Parameterized Complexity of Conflict-Free Set Cover
Authors:
- 16 May 2019
- book chapter
- Published by Springer Nature
- p. 191-202
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The Parameterized Complexity of the k -Biclique ProblemJournal of the ACM, 2018
- Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized2018
- Parameterized Complexity of Geometric Covering Problems Having Conflicts2017
- Efficient Computation of Representative Families with Applications in Parameterized and Exact AlgorithmsJournal of the ACM, 2016
- Parameterized Algorithms2015
- Paths, trees and matchings under disjunctive constraintsDiscrete Applied Mathematics, 2011
- Slightly Superexponential Parameterized Problems2011
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- Polynomially bounded minimization problems which are hard to approximateLecture Notes in Computer Science, 1993
- On diameters and radii of bridged graphsDiscrete Mathematics, 1989