## Abstract

In the Maximum Weight Independent Set of Rectangles (MWISR) problem, we are given a collection of weighted axis-parallel rectangles in the plane. Our goal is to compute a maximum weight subset of pairwise non-overlapping rectangles. Due to its various applications, as well as connections to many other problems in computer science, MWISR has received a lot of attention from the computational geometry and the approximation algorithms community. However, despite being extensively studied, MWISR remains not very well understood in terms of polynomial time approximation algorithms, as there is a large gap between the upper and lower bounds, i.e., O(log n/log log n) v.s. NP-hardness. Another important, poorly understood question is whether one can color rectangles with at most O(ω(R)) colors where ω(R) is the size of a maximum clique in the intersection graph of a set of input rectangles R. Asplund and Grünbaum obtained an upper bound of O(ω(R)^{2}) about 50 years ago, and the result has remained asymptotically best. This question is strongly related to the integrality gap of the canonical LP for MWISR. In this paper, we settle above three open problems in a relaxed model where we are allowed to shrink the rectangles by a tiny bit (rescaling them by a factor of (1-δ) for an arbitrarily small constant δ > 0.) Namely, in this model, we show (i) a PTAS for MWISR and (ii) a coloring with O(ω(R)) colors which implies a constant upper bound on the integrality gap of the canonical LP. For some applications of MWISR the possibility to shrink the rectangles has a natural, wellmotivated meaning. Our results can be seen as an evidence that the shrinking model is a promising way to relax a geometric problem for the purpose of better algorithmic results.

Original language | English |
---|---|

Title of host publication | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015 |

Publisher | Schloss Dagstuhl-Leibniz-Zentrum für Informatik |

Pages | 43-60 |

Number of pages | 18 |

Volume | 40 |

ISBN (Electronic) | 9783939897897 |

DOIs | |

Publication status | Published - 1 Aug 2015 |

MoE publication type | A4 Article in a conference publication |

Event | International Workshop on Approximation Algorithms for Combinatorial Optimization Problems - Princeton, United States Duration: 24 Aug 2015 → 26 Aug 2015 Conference number: 18 |

### Workshop

Workshop | International Workshop on Approximation Algorithms for Combinatorial Optimization Problems |
---|---|

Abbreviated title | APPROX |

Country/Territory | United States |

City | Princeton |

Period | 24/08/2015 → 26/08/2015 |

## Keywords

- Approximation algorithms
- Independent Set
- PTAS
- Rectangle intersection graphs
- Resource augmentation