Imagen de Portada

Extraction Theorems With Small Extraction Numbers

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Agarwal, Arjun, Bandyapadhyay, Sayan
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

An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
por: Bandyapadhyay, Sayan, et al.
Publicado: (2023)

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering
por: Nezhad, Sina Bagheri, et al.
Publicado: (2025)

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

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
por: Biniaz, Ahmad, et al.
Publicado: (2025)

Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
por: Klemz, Boris, et al.
Publicado: (2024)

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

Zone Theorem for Arrangements in three dimensions
por: Saxena, Sanjeev
Publicado: (2020)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
por: Galby, Esther, et al.
Publicado: (2023)

Internally-Convex Drawings of Outerplanar Graphs in Small Area
por: Bekos, Michael A., et al.
Publicado: (2025)

Approximation Algorithms for Smallest Intersecting Balls
por: Zheng, Jiaqi, et al.
Publicado: (2024)

On Approximating the Weighted Region Problem in Square Tessellations
por: Kakimura, Naonori, et al.
Publicado: (2024)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
por: Abrahamsen, Mikkel, et al.
Publicado: (2024)

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

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

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
por: Ebbens, Matthijs, et al.
Publicado: (2024)

Fréchet Distance in Subquadratic Time
por: Cheng, Siu-Wing, et al.
Publicado: (2024)

Computing largest minimum color-spanning intervals of imprecise points
por: Acharyya, Ankush, et al.
Publicado: (2024)

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

Finding maximum matchings in RDV graphs efficiently
por: Biedl, Therese, et al.
Publicado: (2024)

Maintaining Light Spanners via Minimal Updates
por: Khodabandeh, Hadi, et al.
Publicado: (2024)

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

Top-k Stabbing Interval Queries
por: Akram, Waseem, et al.
Publicado: (2024)

Simple Grid Polygon Online Exploration Revisited
por: Brock, Maximilian, et al.
Publicado: (2024)

Sparse Outerstring Graphs Have Logarithmic Treewidth
por: An, Shinwoo, et al.
Publicado: (2024)

Weakly Leveled Planarity with Bounded Span
por: Bekos, Michael, et al.
Publicado: (2024)

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

Data Structures for Range Sorted Consecutive Occurrence Queries
por: Akram, Waseem, et al.
Publicado: (2024)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
por: Banik, Aritra, et al.
Publicado: (2024)

Euclidean distance compression via deep random features
por: Leroux, Brett, et al.
Publicado: (2024)

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

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

Maximizing Weighted Dominance in the Plane
por: Akram, Waseem, et al.
Publicado: (2024)

Computing crossing numbers with topological and geometric restrictions
por: Hamm, Thekla, et al.
Publicado: (2024)

Simple Construction of Greedy Trees and Greedy Permutations
por: Chubet, Oliver, et al.
Publicado: (2024)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
por: Di Battista, Giuseppe, et al.
Publicado: (2024)

Unfairly Splitting Separable Necklaces
por: Schnider, Patrick, et al.
Publicado: (2024)

Dynamic parameterized problems on unit disk graphs
por: An, Shinwoo, et al.
Publicado: (2024)

Spanner for the $0/1/\infty$ weighted region problem
por: Gudmundsson, Joachim, et al.
Publicado: (2024)

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