Cover Image

Fast Approximation Algorithms for Piercing Boxes by Points

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Agarwal, Pankaj K., Har-Peled, Sariel, Raychaudhury, Rahul, Sintos, Stavros
Format:	Preprint
Published:	2023
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
by: Barequet, Gill, et al.
Published: (2025)

Approximating Densest Subgraph in Geometric Intersection Graphs
by: Har-Peled, Sariel, et al.
Published: (2024)

A Practical Approach for Computing the Diameter of a Point Set
by: Har-Peled, Sariel
Published: (2025)

An Output Sensitive Algorithm for Discrete Convex Hulls
by: Har-Peled, Sariel
Published: (2026)

Approximately: Independence Implies Vertex Cover
by: Har-Peled, Sariel
Published: (2023)

Proof of Dudley's Convex Approximation
by: Har-Peled, Sariel, et al.
Published: (2019)

The Complexity of One or Many Faces in the Overlay of Many Arrangements
by: Har-Peled, Sariel
Published: (2025)

Separator for $c$-Packed Segments and Curves
by: Har-Peled, Sariel
Published: (2026)

A Simple Proof of the Existence of a Planar Separator
by: Har-Peled, Sariel
Published: (2011)

How to Get Close to the Median Shape
by: Har-Peled, Sariel
Published: (2026)

The Prophet and the Voronoi Diagram
by: Har-Peled, Sariel
Published: (2026)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
by: Har-Peled, Sariel, et al.
Published: (2014)

Bifurcation: How to Explore a Tree
by: Har-Peled, Sariel
Published: (2025)

Orthogonal Emptiness Queries for Random Points
by: Dullerud, Jonathan E., et al.
Published: (2025)

Near-Optimal Euclidean Locality-Sensitive Orderings
by: Gao, Zhimeng, et al.
Published: (2023)

How Packed Is It, Really?
by: Har-Peled, Sariel, et al.
Published: (2021)

Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
by: Barequet, Gill, et al.
Published: (2025)

In the Search for Good Neck Cuts
by: Ruggerio, Sam, et al.
Published: (2026)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog
by: Har-Peled, Sariel, et al.
Published: (2024)

The Road to the Closest Point is Paved by Good Neighbors
by: Har-Peled, Sariel, et al.
Published: (2025)

No-dimensional Tverberg Partitions Revisited
by: Har-Peled, Sariel, et al.
Published: (2023)

Improving the average dilation of a metric graph by adding edges
by: Har-Peled, Sariel, et al.
Published: (2025)

New Constructions of SSPDs and their Applications
by: Abam, Mohammad A., et al.
Published: (2025)

Dependable Spanners via Unreliable Edges
by: Har-Peled, Sariel, et al.
Published: (2024)

Well-Separated Pairs Decomposition Revisited
by: Har-Peled, Sariel, et al.
Published: (2025)

Graph-Based Nearest-Neighbor Search without the Spread
by: Giliberti, Jeff, et al.
Published: (2026)

Computing Data Distribution from Query Selectivities
by: Agarwal, Pankaj K., et al.
Published: (2024)

On Small Pair Decompositions for Point Sets
by: Buchin, Kevin, et al.
Published: (2026)

An Easy Proof of a Weak Version of Chernoff inequality
by: Har-Peled, Sariel
Published: (2025)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
by: Bhore, Sujoy, et al.
Published: (2024)

Oracle-Augmented Prophet Inequalities
by: Har-Peled, Sariel, et al.
Published: (2024)

Sweeping Arrangements of Non-Piercing Curves in Plane
by: Dalal, Suryendu, et al.
Published: (2024)

Quickly Avoiding a Random Catastrophe
by: Ashur, Stav, et al.
Published: (2025)

Fair Set Cover
by: Dehghankar, Mohsen, et al.
Published: (2024)

Metric $k$-clustering using only Weak Comparison Oracles
by: Raychaudhury, Rahul, et al.
Published: (2026)

A Theoretical Framework for Distribution-Aware Dataset Search
by: Esmailpour, Aryan, et al.
Published: (2025)

Improved Approximation Algorithms for Relational Clustering
by: Esmailpour, Aryan, et al.
Published: (2024)

Online Geometric Covering and Piercing
by: De, Minati, et al.
Published: (2023)

Nearly-Tight Bounds for Vertical Decomposition in Three and Four Dimensions
by: Agarwal, Pankaj K., et al.
Published: (2026)

Near-Optimal Min-Sum Motion Planning in a Planar Polygonal Environment
by: Agarwal, Pankaj K., et al.
Published: (2025)