Pages that link to "Item:Q452004"
From MaRDI portal
The following pages link to Approximation algorithms for maximum independent set of pseudo-disks (Q452004):
Displaying 50 items.
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set (Q510956) (← links)
- Matching colored points with rectangles (Q511687) (← links)
- Generalized disk graphs (Q832849) (← links)
- Improved bounds on the Hadwiger-Debrunner numbers (Q1650467) (← links)
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← links)
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371) (← links)
- Anchored rectangle and square packings (Q1751252) (← links)
- Piercing axis-parallel boxes (Q1753044) (← links)
- Submodular unsplittable flow on trees (Q1801021) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- On Wegner's inequality for axis-parallel rectangles (Q2005682) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- Limit theory of combinatorial optimization for random geometric graphs (Q2075326) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- Stochastic makespan minimization in structured set systems (Q2118147) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- On independent set in \(B_1\)-EPG graphs (Q2174555) (← links)
- Existence of planar support for geometric hypergraphs using elementary techniques (Q2174599) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem (Q2189732) (← links)
- Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q2207604) (← links)
- Constructing planar support for non-piercing regions (Q2207613) (← links)
- Computing inductive vertex orderings (Q2234785) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410) (← links)
- Simple PTAS's for families of graphs excluding a minor (Q2352263) (← links)
- Packing and covering with balls on Busemann surfaces (Q2358828) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- Submodular Unsplittable Flow on Trees (Q3186514) (← links)
- Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
- (Q5009574) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking (Q5111257) (← links)
- (Q5111691) (← links)
- (Q5115778) (← links)
- (Q5115816) (← links)
- From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem (Q5115819) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q5115820) (← links)
- (Q5874486) (← links)
- (Q5874491) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing (Q6046946) (← links)
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. (Q6058197) (← links)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)
- On the geometric priority set cover problem (Q6103173) (← links)
