15 citations · 45 across the 12 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013
Algorithmic and Hardness Results for the Colorful Components Problems
Anna Adamaszek, Alexandru Popa
In this paper we investigate the colorful components framework, motivated by applications emerging from comparative genomics. The general goal is to remove a collection of edges fr…
cs.DS2013
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
Anna Adamaszek, Andreas Wiese
The Maximum Weight Independent Set of Polygons problem is a fundamental problem in computational geometry. Given a set of weighted polygons in the 2-dimensional plane, the goal is…
cs.DS2013★ 15 cited
Approximation Schemes for Maximum Weight Independent Set of Rectangles
Anna Adamaszek, Andreas Wiese
In the Maximum Weight Independent Set of Rectangles (MWISR) problem we are given a set of n axis-parallel rectangles in the 2D-plane, and the goal is to select a maximum weight sub…