Tight Kernels for Covering with Points and Polynomials - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

Tight Kernels for Covering with Points and Polynomials

Résumé

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 Cover 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$. Here, a point p is said to hit a polynomial $f$ if $f (p) = 0$. For both problems, we exhibit tight kernels where $k$ is the parameter. We also exhibit a tight kernel for the Projective Point Hyperplane Cover problem, where the hyperplanes that are allowed to cover the points must all contain a fixed point, and the fixed point cannot be included in the solution set of points.
Fichier principal
Vignette du fichier
main.pdf (532.44 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01518562 , version 1 (04-05-2017)

Identifiants

Citer

Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay. Tight Kernels for Covering with Points and Polynomials. 2017. ⟨hal-01518562⟩
169 Consultations
191 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More