Tight kernels for covering and hitting: Point hyperplane cover and polynomial point hitting set

Jean Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The Point Hyperplane Cover problem in ℝd takes as input a set of n points in ℝ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 ℝd takes as input a family F of D-degree polynomials from a vector space R in ℝd, and determines whether there is a set of at most k points in ℝd that hit all the polynomials in F. For both problems, we exhibit tight kernels where k is the parameter.

Original languageEnglish
Title of host publicationLATIN 2018
Subtitle of host publicationTheoretical Informatics - 13th Latin American Symposium, Proceedings
EditorsMiguel A. Mosteiro, Michael A. Bender, Martin Farach-Colton
PublisherSpringer Verlag
Pages187-200
Number of pages14
ISBN (Print)9783319774039
DOIs
StatePublished - 1 Jan 2018
Externally publishedYes
Event13th International Symposium on Latin American Theoretical Informatics, LATIN 2018 - Buenos Aires, Argentina
Duration: 16 Apr 201819 Apr 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10807 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Symposium on Latin American Theoretical Informatics, LATIN 2018
Country/TerritoryArgentina
CityBuenos Aires
Period16/04/1819/04/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Tight kernels for covering and hitting: Point hyperplane cover and polynomial point hitting set'. Together they form a unique fingerprint.

Cite this