Approximation schemes for maximum weight independent set of rectangles
A Adamaszek, A Wiese - 2013 IEEE 54th annual symposium on …, 2013 - ieeexplore.ieee.org
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 …
of n axis-parallel rectangles in the 2D-plane, and the goal is to select a maximum weight …
Approximating maximum independent set for rectangles in the plane
J Mitchell - SIAM Journal on Computing, 2024 - SIAM
We give a polynomial-time constant-factor approximation algorithm for the maximum
independent set of (axis-aligned) rectangles problem in the plane. Using a polynomial-time …
independent set of (axis-aligned) rectangles problem in the plane. Using a polynomial-time …
Coloring and maximum weight independent set of rectangles
P Chalermsook, B Walczak - Proceedings of the 2021 ACM-SIAM symposium …, 2021 - SIAM
In 1960, Asplund and Grünbaum proved that every intersection graph of axis-parallel
rectangles in the plane admits an O (ω 2)-coloring, where ω is the maximum size of a clique …
rectangles in the plane admits an O (ω 2)-coloring, where ω is the maximum size of a clique …
A 3-approximation algorithm for maximum independent set of rectangles
We study the Maximum Independent Set of Rectangles (MISR) problem, where we are given
a set of axis-parallel rectangles in the plane and the goal is to select a subset of non …
a set of axis-parallel rectangles in the plane and the goal is to select a subset of non …
A (2+\epsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles
We study the Maximum Independent Set of Rectangles (MISR) problem, where we are given
a set of axis-parallel rectangles in the plane and the goal is to select a subset of non …
a set of axis-parallel rectangles in the plane and the goal is to select a subset of non …
A PTAS for unsplittable flow on a path
In the Unsplittable Flow on a Path problem (UFP) we are given a path with edge capacities,
and a set of tasks where each task is characterized by a subpath, a demand, and a weight …
and a set of tasks where each task is characterized by a subpath, a demand, and a weight …
[HTML][HTML] Max point-tolerance graphs
A graph G is a max point-tolerance (MPT) graph if each vertex v of G can be mapped to a
pointed-interval (I v, pv) where I v is an interval of R and pv∈ I v such that uv is an edge of G …
pointed-interval (I v, pv) where I v is an interval of R and pv∈ I v such that uv is an edge of G …
On approximating maximum independent set of rectangles
We study the Maximum Independent Set of Rectangles (MISR) problem: given a set of n axis-
parallel rectangles, find a largest-cardinality subset of the rectangles, such that no two of …
parallel rectangles, find a largest-cardinality subset of the rectangles, such that no two of …
On guillotine separability of squares and rectangles
Guillotine separability of rectangles has recently gained prominence in combinatorial
optimization, computational geometry, and combinatorics. Consider a given large stock unit …
optimization, computational geometry, and combinatorics. Consider a given large stock unit …
Grounded L-Graphs Are Polynomially -Bounded
A grounded L-graph is the intersection graph of a collection of “L” shapes whose topmost
points belong to a common horizontal line. We prove that every grounded L-graph with …
points belong to a common horizontal line. We prove that every grounded L-graph with …