Maximum independent set of rectangles
From MaRDI portal
Publication:4633902
Recommendations
- A note on maximum independent sets in rectangle intersection graphs
- Label placement by maximum independent set in rectangles
- Coloring and maximum independent set of rectangles
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- Independent and hitting sets of rectangles intersecting a diagonal line
Cited in
(40)- Computing maximum independent set on outerstring graphs and their relatives
- Independent and hitting sets of rectangles intersecting a diagonal line
- The maximum exposure problem
- Minimum point-overlap labelling*
- Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles
- Stochastic makespan minimization in structured set systems (extended abstract)
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- Maximum bipartite subgraphs of geometric intersection graphs
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking
- On Wegner's inequality for axis-parallel rectangles
- Stochastic makespan minimization in structured set systems
- Winner determination in geometrical combinatorial auctions
- Approximation algorithms for free-label maximization
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve
- Independent sets and hitting sets of bicolored rectangular families
- Near-linear algorithms for geometric hitting sets and set covers
- Mixed Map Labeling
- Optimization problems in dotted interval graphs
- A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
- Improved algorithms for resource allocation under varying capacity
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
- Keep your distance: land division with separation
- A note on maximum independent sets in rectangle intersection graphs
- Submodular unsplittable flow on trees
- Independent set in \(k\)-claw-free graphs: conditional \(\chi \)-boundedness and the power of LP/SDP relaxations
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
- Anchored rectangle and square packings
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- Minimum vertex cover in rectangle graphs
- How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking
- Coloring and maximum independent set of rectangles
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
- Approximation algorithms on consistent dynamic map labeling
- Approximation algorithms for maximum independent set of pseudo-disks
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- Matching colored points with rectangles
- Geometric Packing under Nonuniform Constraints
- scientific article; zbMATH DE number 7651158 (Why is no real title available?)
This page was built for publication: Maximum independent set of rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633902)
