Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2018

Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set

Abstract

The Point Hyperplane Cover problem in R d takes as input a set of n points in R d and a positive integer k. The objective is to cover all the given points with a set of at most k hyperplanes. The D-Polynomial Points Hitting Set (D-Polynomial Points HS) problem in R d takes as input a family F of D-degree polynomials from a vector space R in R d , and determines whether there is a set of at most k points in R d that hit all the polynomials in F. For both problems, we exhibit tight kernels where k is the parameter.
Fichier principal
Vignette du fichier
main.pdf (337.56 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01669884 , version 1 (21-12-2017)

Identifiers

  • HAL Id : hal-01669884 , version 1

Cite

J.-D Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay. Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set. LATIN 2018 - 13th Latin American Theoretical INformatics Symposium, Apr 2018, Buenos Aires, Argentina. ⟨hal-01669884⟩
221 View
320 Download

Share

More