Pages that link to "Item:Q452004"

The following pages link to Approximation algorithms for maximum independent set of pseudo-disks (Q452004):

Displaying 23 items.

• (Q5115778) (← links)
• Optimality of geometric local search (Q5115816) (← links)
• From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem (Q5115819) (← links)
• Coloring intersection hypergraphs of pseudo-disks (Q5115820) (← links)
• Minimum Point-Overlap Labeling (Q5283379) (← links)
• Approximation algorithms for maximum independent set of pseudo-disks (Q5370733) (← links)
• (Q5874486) (← links)
• (Q5874491) (← links)
• Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains (Q5918442) (← links)
• Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
• Maximum independent and disjoint coverage (Q5918798) (← links)
• Covering and packing of rectilinear subdivision (Q5918965) (← links)
• Local search strikes again: PTAS for variants of geometric covering and packing (Q5919362) (← links)
• Approximability of covering cells with line segments (Q5919568) (← 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)
• Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
• Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)
• Lower bounds for piercing and coloring boxes (Q6187716) (← links)
• PTASs for secure dominating set in planar graphs and growth-bounded graphs (Q6611035) (← links)