Question text from the original paper, with its maths as pictures

(A) There is a polynomial-time reduction from BoxDepth to MaxClique.

(B) There is a polynomial-time algorithm for BoxDepth.

(D) BoxDepth can be solved in polynomial time by sweeping a vertical line and maintaining the maximum number of overlapping rectangles at any point.

(C) Question text from the original paper, with its maths as pictures

Advanced Algorithms · Quiz 1 · 15 Mar 2026 · January 2026 term

Advanced Algorithms Quiz 1 15 Mar 2026 — Question 11

Question 11

+3 marksOne or more correct options

Select all that apply.

A
There is a polynomial-time reduction from BoxDepth to MaxClique.
B
There is a polynomial-time algorithm for BoxDepth.
C
D
BoxDepth can be solved in polynomial time by sweeping a vertical line and maintaining the maximum number of overlapping rectangles at any point.

Show answer

Correct answers

A
There is a polynomial-time reduction from BoxDepth to MaxClique.
B
There is a polynomial-time algorithm for BoxDepth.
D
BoxDepth can be solved in polynomial time by sweeping a vertical line and maintaining the maximum number of overlapping rectangles at any point.

See the whole paper Take it as a mock test

Question 11 of 16 in the IIT Madras BS Advanced Algorithms (Advanced Algorithms) Quiz 1 paper sat on 15 Mar 2026, in the January 2026 term (Advanced Algorithms 15 Mar 26). It carries 3 marks.

Advanced Algorithms Quiz 1 15 Mar 2026 — Question 11

Question 11

More questions from this paper