Maximum independent set of rectangles
From MaRDI portal
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
(50)- A note on maximum independent sets in rectangle intersection graphs
- Label placement by maximum independent set in rectangles
- Improved algorithms for resource allocation under varying capacity
- Winner determination in geometrical combinatorial auctions
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
- Anchored rectangle and square packings
- Submodular unsplittable flow on trees
- On Wegner's inequality for axis-parallel rectangles
- Independent sets and hitting sets of bicolored rectangular families
- Stochastic makespan minimization in structured set systems
- The maximum exposure problem
- Near-linear algorithms for geometric hitting sets and set covers
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling
- Approximation algorithms on consistent dynamic map labeling
- Mixed Map Labeling
- Coloring and maximum independent set of rectangles
- A (2+)-approximation algorithm for the storage allocation problem
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve
- Optimization problems in dotted interval graphs
- Approximation algorithms for free-label maximization
- Approximation algorithms for maximum independent set of pseudo-disks
- Geometric Packing under Nonuniform Constraints
- Minimum point-overlap labelling*
- Stochastic makespan minimization in structured set systems (extended abstract)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking
- Matching colored points with rectangles
- How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking
- Independent and hitting sets of rectangles intersecting a diagonal line
- Minimum vertex cover in rectangle graphs
- scientific article; zbMATH DE number 7651158 (Why is no real title available?)
- Computing maximum independent set on outerstring graphs and their relatives
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
- Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- Keep your distance: land division with separation
- Maximum bipartite subgraphs of geometric intersection graphs
- Independent set in \(k\)-claw-free graphs: conditional \(\chi \)-boundedness and the power of LP/SDP relaxations
- Approximation of MWIS on geometric intersection graphs
- Approximating the maximum independent set of convex polygons with a bounded number of directions
- Learning-augmented maximum independent set
- Recognizing integrality of weighted rectangles partitions
- Improved approximation algorithms for 2-dimensional knapsack: packing into multiple l-shapes, spirals, and more
- Random-order online independent set of intervals and hyperrectangles
- An improved guillotine cut for squares
- Dynamic streaming algorithms for geometric independent set
- Covering simple orthogonal polygons with rectangles
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)
