Question: Consider the following problem, called BOXDEPTH: Given a set of n axis-aligned rectangles in the plane, how big is the largest subset of these rectangles
Consider the following problem, called BOXDEPTH: Given a set of n axis-aligned rectangles in the plane, how big is the largest subset of these rectangles that contain a common point?
(a) Describe a polynomial-time reduction from BOXDEPTH to MAXCLIQUE.
(b) Describe and analyze a polynomial-time algorithm for BOXDEPTH. [Hint: O(n3) time should
be easy, but O(n log n) time is possible.]
(c) Why dont these two results imply that P=NP?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
