Point line cover

The easy kernel is essentially tight

Stefan Kratsch, Geevarghese Philip, Saurabh Ray

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The input to the NP-hard Point Line Cover problem (PLC) consists of a set V of n points on the plane and a positive integer k, and the question is whether there exists a set of at most k lines which pass through all points in V. By straightforward reduction rules one can efficiently reduce any input to one with at most k2 points. We show that this easy reduction is already essentially tight under standard assumptions. More precisely, unless the polynomial hierarchy collapses to its third level, for any ε > 0, there is no polynomial-time algorithm that reduces every instance (P, k) of PLC to an equivalent instance with O(k2-ε) points. This answers, in the negative, an open problem posed by Lokshtanov (PhD Thesis, 2009). Our proof uses the notion of a kernel from parameterized complexity, and the machinery for deriving lower bounds on the size of kernels developed by Dell and van Melkebeek (STOC 2010). It has two main ingredients: We first show, by reduction from Vertex Cover, that-unless the polynomial hierarchy collapses-PLC has no kernel of total size O(k2-ε) bits. This does not directly imply the claimed lower bound on the number of points, since the best known polynomial-time encoding of a PLC instance with n points requires ω(n 2) bits. To get around this hurdle we build on work of Goodman, Pollack and Sturmfels (STOC 1989) and devise an oracle communication protocol of cost O(n log n) for PLC; its main building blocks are a bound of O(N O(n)) for the order types of n points that are not necessarily in general position and an explicit (albeit slow) algorithm that enumerates a superset of size NO(n) of all possible order types of n points. This protocol, together with the lower bound on the total size (which also holds for such protocols), yields the stated lower bound on the number of points. While a number of essentially tight polynomial lower bounds on total sizes of kernels are known, our result is-to the best of our knowledge-the first to show a nontrivial lower bound for structural/secondary parameters.

Original languageEnglish (US)
Title of host publicationProceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014
PublisherAssociation for Computing Machinery
Pages1596-1606
Number of pages11
ISBN (Print)9781611973389
StatePublished - Jan 1 2014
Event25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014 - Portland, OR, United States
Duration: Jan 5 2014Jan 7 2014

Other

Other25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014
CountryUnited States
CityPortland, OR
Period1/5/141/7/14

Fingerprint

Polynomials
Cover
kernel
Line
Network protocols
Lower bound
Polynomial Hierarchy
Machinery
Order Type
Parameterized Complexity
Costs
Vertex Cover
Communication Protocol
Building Blocks
Polynomial-time Algorithm
Open Problems
Polynomial time
Encoding
NP-complete problem
Imply

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Kratsch, S., Philip, G., & Ray, S. (2014). Point line cover: The easy kernel is essentially tight. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014 (pp. 1596-1606). Association for Computing Machinery.

Point line cover : The easy kernel is essentially tight. / Kratsch, Stefan; Philip, Geevarghese; Ray, Saurabh.

Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, 2014. p. 1596-1606.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kratsch, S, Philip, G & Ray, S 2014, Point line cover: The easy kernel is essentially tight. in Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, pp. 1596-1606, 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, OR, United States, 1/5/14.
Kratsch S, Philip G, Ray S. Point line cover: The easy kernel is essentially tight. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery. 2014. p. 1596-1606
Kratsch, Stefan ; Philip, Geevarghese ; Ray, Saurabh. / Point line cover : The easy kernel is essentially tight. Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, 2014. pp. 1596-1606
@inproceedings{e6051697d35a43afb15cdc01c8e99473,
title = "Point line cover: The easy kernel is essentially tight",
abstract = "The input to the NP-hard Point Line Cover problem (PLC) consists of a set V of n points on the plane and a positive integer k, and the question is whether there exists a set of at most k lines which pass through all points in V. By straightforward reduction rules one can efficiently reduce any input to one with at most k2 points. We show that this easy reduction is already essentially tight under standard assumptions. More precisely, unless the polynomial hierarchy collapses to its third level, for any ε > 0, there is no polynomial-time algorithm that reduces every instance (P, k) of PLC to an equivalent instance with O(k2-ε) points. This answers, in the negative, an open problem posed by Lokshtanov (PhD Thesis, 2009). Our proof uses the notion of a kernel from parameterized complexity, and the machinery for deriving lower bounds on the size of kernels developed by Dell and van Melkebeek (STOC 2010). It has two main ingredients: We first show, by reduction from Vertex Cover, that-unless the polynomial hierarchy collapses-PLC has no kernel of total size O(k2-ε) bits. This does not directly imply the claimed lower bound on the number of points, since the best known polynomial-time encoding of a PLC instance with n points requires ω(n 2) bits. To get around this hurdle we build on work of Goodman, Pollack and Sturmfels (STOC 1989) and devise an oracle communication protocol of cost O(n log n) for PLC; its main building blocks are a bound of O(N O(n)) for the order types of n points that are not necessarily in general position and an explicit (albeit slow) algorithm that enumerates a superset of size NO(n) of all possible order types of n points. This protocol, together with the lower bound on the total size (which also holds for such protocols), yields the stated lower bound on the number of points. While a number of essentially tight polynomial lower bounds on total sizes of kernels are known, our result is-to the best of our knowledge-the first to show a nontrivial lower bound for structural/secondary parameters.",
author = "Stefan Kratsch and Geevarghese Philip and Saurabh Ray",
year = "2014",
month = "1",
day = "1",
language = "English (US)",
isbn = "9781611973389",
pages = "1596--1606",
booktitle = "Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Point line cover

T2 - The easy kernel is essentially tight

AU - Kratsch, Stefan

AU - Philip, Geevarghese

AU - Ray, Saurabh

PY - 2014/1/1

Y1 - 2014/1/1

N2 - The input to the NP-hard Point Line Cover problem (PLC) consists of a set V of n points on the plane and a positive integer k, and the question is whether there exists a set of at most k lines which pass through all points in V. By straightforward reduction rules one can efficiently reduce any input to one with at most k2 points. We show that this easy reduction is already essentially tight under standard assumptions. More precisely, unless the polynomial hierarchy collapses to its third level, for any ε > 0, there is no polynomial-time algorithm that reduces every instance (P, k) of PLC to an equivalent instance with O(k2-ε) points. This answers, in the negative, an open problem posed by Lokshtanov (PhD Thesis, 2009). Our proof uses the notion of a kernel from parameterized complexity, and the machinery for deriving lower bounds on the size of kernels developed by Dell and van Melkebeek (STOC 2010). It has two main ingredients: We first show, by reduction from Vertex Cover, that-unless the polynomial hierarchy collapses-PLC has no kernel of total size O(k2-ε) bits. This does not directly imply the claimed lower bound on the number of points, since the best known polynomial-time encoding of a PLC instance with n points requires ω(n 2) bits. To get around this hurdle we build on work of Goodman, Pollack and Sturmfels (STOC 1989) and devise an oracle communication protocol of cost O(n log n) for PLC; its main building blocks are a bound of O(N O(n)) for the order types of n points that are not necessarily in general position and an explicit (albeit slow) algorithm that enumerates a superset of size NO(n) of all possible order types of n points. This protocol, together with the lower bound on the total size (which also holds for such protocols), yields the stated lower bound on the number of points. While a number of essentially tight polynomial lower bounds on total sizes of kernels are known, our result is-to the best of our knowledge-the first to show a nontrivial lower bound for structural/secondary parameters.

AB - The input to the NP-hard Point Line Cover problem (PLC) consists of a set V of n points on the plane and a positive integer k, and the question is whether there exists a set of at most k lines which pass through all points in V. By straightforward reduction rules one can efficiently reduce any input to one with at most k2 points. We show that this easy reduction is already essentially tight under standard assumptions. More precisely, unless the polynomial hierarchy collapses to its third level, for any ε > 0, there is no polynomial-time algorithm that reduces every instance (P, k) of PLC to an equivalent instance with O(k2-ε) points. This answers, in the negative, an open problem posed by Lokshtanov (PhD Thesis, 2009). Our proof uses the notion of a kernel from parameterized complexity, and the machinery for deriving lower bounds on the size of kernels developed by Dell and van Melkebeek (STOC 2010). It has two main ingredients: We first show, by reduction from Vertex Cover, that-unless the polynomial hierarchy collapses-PLC has no kernel of total size O(k2-ε) bits. This does not directly imply the claimed lower bound on the number of points, since the best known polynomial-time encoding of a PLC instance with n points requires ω(n 2) bits. To get around this hurdle we build on work of Goodman, Pollack and Sturmfels (STOC 1989) and devise an oracle communication protocol of cost O(n log n) for PLC; its main building blocks are a bound of O(N O(n)) for the order types of n points that are not necessarily in general position and an explicit (albeit slow) algorithm that enumerates a superset of size NO(n) of all possible order types of n points. This protocol, together with the lower bound on the total size (which also holds for such protocols), yields the stated lower bound on the number of points. While a number of essentially tight polynomial lower bounds on total sizes of kernels are known, our result is-to the best of our knowledge-the first to show a nontrivial lower bound for structural/secondary parameters.

UR - http://www.scopus.com/inward/record.url?scp=84902097273&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902097273&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781611973389

SP - 1596

EP - 1606

BT - Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014

PB - Association for Computing Machinery

ER -