Image de couverture de livre

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bhore, Sujoy, Chan, Timothy M.
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Dynamic and Streaming Algorithms for Union Volume Estimation
par: Bhore, Sujoy, et autres
Publié: (2026)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
par: Bhore, Sujoy, et autres
Publié: (2025)

Approximately: Independence Implies Vertex Cover
par: Har-Peled, Sariel
Publié: (2023)

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

Dynamic Light Spanners in Doubling Metrics
par: Bhore, Sujoy, et autres
Publié: (2026)

Light Spanners with Small Hop-Diameter
par: Bhore, Sujoy, et autres
Publié: (2025)

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

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

Fully Dynamic Geometric Vertex Cover and Matching
par: Bhore, Sujoy, et autres
Publié: (2024)

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

Enclosing Points with Geometric Objects
par: Chan, Timothy M., et autres
Publié: (2024)

Small Independent Sets versus Small Separator in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2026)

An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

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

Clustering under Constraints: Efficient Parameterized Approximation Schemes
par: Bhore, Sujoy, et autres
Publié: (2025)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
par: Chan, Timothy M., et autres
Publié: (2025)

Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
par: Klemz, Boris, et autres
Publié: (2024)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2025)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
par: Galby, Esther, et autres
Publié: (2023)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
par: Park, Seongbin, et autres
Publié: (2026)

Visibility Queries in Simple Polygons
par: Bhore, Sujoy, et autres
Publié: (2026)

Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
par: Saito, Rin, et autres
Publié: (2025)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
par: Chan, Timothy M., et autres
Publié: (2026)

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

Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching
par: Hougardy, Stefan, et autres
Publié: (2024)

Range Counting Oracles for Geometric Problems
par: Driemel, Anne, et autres
Publié: (2025)

Approximation Algorithms for Smallest Intersecting Balls
par: Zheng, Jiaqi, et autres
Publié: (2024)

On Approximating the Dynamic and Discrete Network Flow Problem
par: Manna, Bubai, et autres
Publié: (2024)

On Approximating the Weighted Region Problem in Square Tessellations
par: Kakimura, Naonori, et autres
Publié: (2024)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2026)

Fast Algorithms for Minimum Homology Basis
par: Dhar, Amritendu, et autres
Publié: (2021)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
par: Danait, Ved, et autres
Publié: (2025)

On the Complexity of the Ordered Covering Problem in Distance Geometry
par: Souza, Michael, et autres
Publié: (2025)

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

Delaunay Triangulations with Predictions
par: Cabello, Sergio, et autres
Publié: (2026)

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

Improved Approximation Algorithms for Three-Dimensional Bin Packing
par: Kar, Debajyoti, et autres
Publié: (2025)

Algorithms for Halfplane Coverage and Related Problems
par: Wang, Haitao, et autres
Publié: (2024)

Improved Algorithms for Distance Selection and Related Problems
par: Wang, Haitao, et autres
Publié: (2023)