Image de couverture de livre

Online Hitting Sets for Disks of Bounded Radii

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	De, Minati, Singh, Satyam, Tóth, Csaba D.
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Hitting Set for Axis-Aligned Squares
par: De, Minati, et autres
Publié: (2025)

New Lower Bound and Algorithms for Online Geometric Hitting Set Problem
par: De, Minati, et autres
Publié: (2024)

Online Geometric Hitting Set and Set Cover Beyond Unit Balls in $\mathbb{R}^2$
par: De, Minati, et autres
Publié: (2023)

Online Hitting of Unit Balls and Hypercubes in $\mathbb{R}^d$ using Points from $\mathbb{Z}^d$
par: De, Minati, et autres
Publié: (2023)

Online Algorithms for Geometric Independent Set
par: De, Minati, et autres
Publié: (2026)

Online Geometric Covering and Piercing
par: De, Minati, et autres
Publié: (2023)

Online Epsilon Net and Piercing Set for Geometric Concepts
par: Bhore, Sujoy, et autres
Publié: (2024)

Online Class Cover Problem
par: De, Minati, et autres
Publié: (2023)

On RAC Drawings of Graphs with Two Bends per Edge
par: Tóth, Csaba D.
Publié: (2023)

Observation Routes and External Watchman Routes
par: Dumitrescu, Adrian, et autres
Publié: (2023)

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
par: Bhore, Sujoy, et autres
Publié: (2023)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
par: Liu, Gang, et autres
Publié: (2024)

Maximal Distortion of Geodesic Diameters in Polygonal Domains
par: Dumitrescu, Adrian, et autres
Publié: (2023)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
par: Bhore, Sujoy, et autres
Publié: (2026)

Hop-Spanners for Geometric Intersection Graphs
par: Conroy, Jonathan B., et autres
Publié: (2021)

Clustering with Few Disks to Minimize the Sum of Radii
par: Abrahamsen, Mikkel, et autres
Publié: (2023)

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
par: Bhore, Sujoy, et autres
Publié: (2025)

Euclidean Steiner Shallow-Light Trees in Higher Dimensions
par: Frost, Devin, et autres
Publié: (2026)

Aspect Ratio Universal Rectangular Layouts
par: Felsner, Stefan, et autres
Publié: (2021)

Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
par: Gao, Jie, et autres
Publié: (2025)

Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
par: Depian, Thomas, et autres
Publié: (2026)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
par: Biniaz, Ahmad, et autres
Publié: (2025)

An Optimal Algorithm for Half-plane Hitting Set
par: Liu, Gang, et autres
Publié: (2025)

Minimum-Weight Half-Plane Hitting Set
par: Liu, Gang, et autres
Publié: (2025)

Existence of a Convex Polyhedron with Respect to the Given Radii
par: Chaidee, Supanut, et autres
Publié: (2019)

Minimum Plane Bichromatic Spanning Trees
par: Akitaya, Hugo A., et autres
Publié: (2024)

Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
par: Bhore, Sujoy, et autres
Publié: (2026)

Approximating Euclidean Shallow-Light Trees
par: Le, Hung, et autres
Publié: (2025)

Maximum Independent Sets in Disk Graphs with Disks in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2026)

Disk and Partial Disk Inspection: Worst- to Average-Case and Pareto Upper Bounds
par: Conley, James, et autres
Publié: (2024)

Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2026)

The Price of Connectivity Augmentation on Planar Graphs
par: Akitaya, Hugo A., et autres
Publié: (2025)

Noncrossing Longest Paths and Cycles
par: Aloupis, Greg, et autres
Publié: (2024)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
par: Liu, Shuilian, et autres
Publié: (2025)

Towards Instance-Optimal Euclidean Spanners
par: Le, Hung, et autres
Publié: (2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
par: Bhore, Sujoy, et autres
Publié: (2024)

Ordered Front-to-back Any-Hit Traversal in RTX
par: Wald, Ingo
Publié: (2026)

Computing Dominating Sets in Disk Graphs with Centers in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2026)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
par: Bandyapadhyay, Sayan, et autres
Publié: (2023)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
par: Grandoni, Fabrizio, et autres
Publié: (2026)