Imagen de Portada

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bhore, Sujoy, Gupta, Anupam, Kumar, Amit
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
por: Bhore, Sujoy, et al.
Publicado: (2025)

Light Spanners with Small Hop-Diameter
por: Bhore, Sujoy, et al.
Publicado: (2025)

Online Algorithms for Geometric Independent Set
por: De, Minati, et al.
Publicado: (2026)

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
por: Bhore, Sujoy, et al.
Publicado: (2023)

An Optimal Algorithm for Half-plane Hitting Set
por: Liu, Gang, et al.
Publicado: (2025)

Dynamic and Streaming Algorithms for Union Volume Estimation
por: Bhore, Sujoy, et al.
Publicado: (2026)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
por: Liu, Gang, et al.
Publicado: (2024)

Dynamic Light Spanners in Doubling Metrics
por: Bhore, Sujoy, et al.
Publicado: (2026)

Minimum-Weight Half-Plane Hitting Set
por: Liu, Gang, et al.
Publicado: (2025)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
por: Bhore, Sujoy, et al.
Publicado: (2024)

Small Independent Sets versus Small Separator in Geometric Intersection Graphs
por: Marin, Malory, et al.
Publicado: (2026)

Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
por: Biedl, Therese, et al.
Publicado: (2026)

Visibility Queries in Simple Polygons
por: Bhore, Sujoy, et al.
Publicado: (2026)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
por: Grandoni, Fabrizio, et al.
Publicado: (2026)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
por: Park, Seongbin, et al.
Publicado: (2026)

On Fair Epsilon Net and Geometric Hitting Set
por: Dehghankar, Mohsen, et al.
Publicado: (2025)

Online TCP Acknowledgment under General Delays
por: Bhore, Sujoy, et al.
Publicado: (2026)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
por: de Berg, Mark, et al.
Publicado: (2026)

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
por: P V, Althaf, et al.
Publicado: (2026)

Hitting Axis-Parallel Segments with Weighted Points
por: Raman, Rajiv, et al.
Publicado: (2026)

Knapsack with Vertex Cover, Set Cover, and Hitting Set
por: Dey, Palash, et al.
Publicado: (2024)

Online Maximum Independent Set of Hyperrectangles
por: Advani, Rishi, et al.
Publicado: (2023)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
por: Chan, Timothy M., et al.
Publicado: (2025)

Maximum Independent Sets in Disk Graphs with Disks in Convex Position
por: Tkachenko, Anastasiia, et al.
Publicado: (2026)

Computing Dominating Sets in Disk Graphs with Centers in Convex Position
por: Tkachenko, Anastasiia, et al.
Publicado: (2026)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
por: Marin, Malory, et al.
Publicado: (2025)

An Algorithm for Fast and Correct Computation of Reeb Spaces for PL Bivariate Fields
por: Chattopadhyay, Amit, et al.
Publicado: (2024)

Single-Criteria Metric $r$-Dominating Set Problem via Minor-Preserving Support
por: Browne, Reilly, et al.
Publicado: (2026)

Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
por: Duraj, Lech, et al.
Publicado: (2023)

On the Exponential Growth of Geometric Shapes
por: Almalki, Nada, et al.
Publicado: (2023)

Improved Algorithms for Distance Selection and Related Problems
por: Wang, Haitao, et al.
Publicado: (2023)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
por: Bhore, Sujoy, et al.
Publicado: (2025)

Improved Approximation Algorithms for Three-Dimensional Bin Packing
por: Kar, Debajyoti, et al.
Publicado: (2025)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
por: Banik, Aritra, et al.
Publicado: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2024)

Exact Algorithms for Clustered Planarity with Linear Saturators
por: Da Lozzo, Giordano, et al.
Publicado: (2024)

Random Order Set Cover is as Easy as Offline
por: Gupta, Anupam, et al.
Publicado: (2021)

Improved Hardness of Approximation for Geometric Bin Packing
por: Ray, Arka, et al.
Publicado: (2023)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
por: Ihalainen, Hannes, et al.
Publicado: (2025)