Pages that link to "Item:Q1583093"
From MaRDI portal
The following pages link to Fast stabbing of boxes in high dimensions (Q1583093):
Displaying 13 items.
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
- A note on maximum independent sets in rectangle intersection graphs (Q1029038) (← links)
- An improved algorithm for online unit clustering (Q1040649) (← links)
- Disjunctive splittability of languages (Q1105047) (← links)
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371) (← links)
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- Coloring and Maximum Independent Set of Rectangles (Q3088088) (← links)
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
- Improved bound for the Gerver-Ramsey collinearity problem (Q6080207) (← links)
- Lower bounds for piercing and coloring boxes (Q6187716) (← links)
