Imagen de Portada

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Gang, Wang, Haitao
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Line-Separable Unit-Disk Coverage and Related Problems
por: Liu, Gang, et al.
Publicado: (2023)

On Line-Separable Weighted Unit-Disk Coverage and Related Problems
por: Liu, Gang, et al.
Publicado: (2024)

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

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

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2025)

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

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
por: Bhore, Sujoy, et al.
Publicado: (2026)

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

Algorithms for Halfplane Coverage and Related Problems
por: Wang, Haitao, et al.
Publicado: (2024)

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

Dynamic Unit-Disk Range Reporting
por: Wang, Haitao, et al.
Publicado: (2024)

Computing Maximum Cliques in Unit Disk Graphs
por: Tkachenko, Anastasiia, et al.
Publicado: (2025)

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

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)

Parameterized Geometric Graph Modification with Disk Scaling
por: Fomin, Fedor V., et al.
Publicado: (2024)

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

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

Single-Source Shortest Path Problem in Weighted Disk Graphs
por: An, Shinwoo, et al.
Publicado: (2025)

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

Range Counting Oracles for Geometric Problems
por: Driemel, Anne, et al.
Publicado: (2025)

Algorithms for Computing Closest Points for Segments
por: Wang, Haitao
Publicado: (2024)

Counting Unit Circular Arc Intersections
por: Wang, Haitao
Publicado: (2026)

A Deterministic Partition Tree and Applications
por: Wang, Haitao
Publicado: (2025)

Shortest Paths on Convex Polyhedral Surfaces
por: Wang, Haitao
Publicado: (2025)

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
por: Bartlmae, Simon, et al.
Publicado: (2024)

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

Unweighted Layered Graph Traversal: Passing a Crown via Entropy Maximization
por: Bai, Xingjian, et al.
Publicado: (2024)

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

Dynamic Connectivity in Disk Graphs
por: Baumann, Alexander, et al.
Publicado: (2021)

A PTAS for Travelling Salesman Problem with Neighbourhoods Over Parallel Line Segments of Similar Length
por: Ghaseminia, Benyamin, et al.
Publicado: (2025)

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

Shortest Path Separators in Unit Disk Graphs
por: Harb, Elfarouk, et al.
Publicado: (2024)

Dynamic Convex Hulls for Simple Paths
por: Brewer, Bruce, et al.
Publicado: (2024)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
por: Chan, Timothy M., et al.
Publicado: (2025)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
por: An, Shinwoo, et al.
Publicado: (2024)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2024)

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
por: Koana, Tomohiro, et al.
Publicado: (2024)

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

Duality between Lines and Points
por: Saxena, Sanjeev
Publicado: (2025)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
por: Lokshtanov, Daniel, et al.
Publicado: (2024)