Saved in:
| Main Authors: | Evans, William, Tabatabaee, Seyed Ali |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2304.10028 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
by: Bandyapadhyay, Sayan, et al.
Published: (2023)
by: Bandyapadhyay, Sayan, et al.
Published: (2023)
Maintaining Light Spanners via Minimal Updates
by: Khodabandeh, Hadi, et al.
Published: (2024)
by: Khodabandeh, Hadi, et al.
Published: (2024)
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
by: Dobler, Alexander, et al.
Published: (2024)
by: Dobler, Alexander, et al.
Published: (2024)
Coresets for Constrained Clustering: General Assignment Constraints and Improved Size Bounds
by: Huang, Lingxiao, et al.
Published: (2023)
by: Huang, Lingxiao, et al.
Published: (2023)
Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
by: Fomin, Fedor V., et al.
Published: (2025)
by: Fomin, Fedor V., et al.
Published: (2025)
Computing Dominating Sets in Disk Graphs with Centers in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2026)
by: Tkachenko, Anastasiia, et al.
Published: (2026)
Hybrid k-Clustering: Blending k-Median and k-Center
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
On Approximating the Weighted Region Problem in Square Tessellations
by: Kakimura, Naonori, et al.
Published: (2024)
by: Kakimura, Naonori, et al.
Published: (2024)
A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
by: Ebbens, Matthijs, et al.
Published: (2024)
by: Ebbens, Matthijs, et al.
Published: (2024)
Morphing Planar Graph Drawings Through 3D
by: Buchin, Kevin, et al.
Published: (2022)
by: Buchin, Kevin, et al.
Published: (2022)
Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
by: Garcia, Javier, et al.
Published: (2025)
by: Garcia, Javier, et al.
Published: (2025)
Hardness of Median and Center in the Ulam Metric
by: Fischer, Nick, et al.
Published: (2025)
by: Fischer, Nick, et al.
Published: (2025)
Fine-Grained Complexity of Continuous Euclidean k-Center
by: Blank, Lotte, et al.
Published: (2026)
by: Blank, Lotte, et al.
Published: (2026)
Coreset for Robust Geometric Median: Eliminating Size Dependency on Outliers
by: Fang, Ziyi, et al.
Published: (2025)
by: Fang, Ziyi, et al.
Published: (2025)
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
by: Gudmundsson, Joachim, et al.
Published: (2021)
by: Gudmundsson, Joachim, et al.
Published: (2021)
Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
by: Berthe, Gaétan, et al.
Published: (2023)
by: Berthe, Gaétan, et al.
Published: (2023)
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
by: de Berg, Sarita, et al.
Published: (2023)
by: de Berg, Sarita, et al.
Published: (2023)
The Complexity of Geodesic Spanners
by: de Berg, Sarita, et al.
Published: (2023)
by: de Berg, Sarita, et al.
Published: (2023)
Relating Interleaving and Fréchet Distances via Ordered Merge Trees
by: Beurskens, Thijs, et al.
Published: (2023)
by: Beurskens, Thijs, et al.
Published: (2023)
Feature-aware manifold meshing and remeshing of point clouds and polyhedral surfaces with guaranteed smallest edge length
by: Lipschütz, Henriette, et al.
Published: (2023)
by: Lipschütz, Henriette, et al.
Published: (2023)
Approximately: Independence Implies Vertex Cover
by: Har-Peled, Sariel
Published: (2023)
by: Har-Peled, Sariel
Published: (2023)
Ortho-Radial Drawing in Near-Linear Time
by: Chang, Yi-Jun
Published: (2023)
by: Chang, Yi-Jun
Published: (2023)
Improved Algorithms for Distance Selection and Related Problems
by: Wang, Haitao, et al.
Published: (2023)
by: Wang, Haitao, et al.
Published: (2023)
On the Line-Separable Unit-Disk Coverage and Related Problems
by: Liu, Gang, et al.
Published: (2023)
by: Liu, Gang, et al.
Published: (2023)
Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
by: Eppstein, David
Published: (2023)
by: Eppstein, David
Published: (2023)
Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
by: Duraj, Lech, et al.
Published: (2023)
by: Duraj, Lech, et al.
Published: (2023)
Dynamically Maintaining the Persistent Homology of Time Series
by: di Montesano, Sebastiano Cultrera, et al.
Published: (2023)
by: di Montesano, Sebastiano Cultrera, et al.
Published: (2023)
Faster Approximation Scheme for Euclidean $k$-TSP
by: van Wijland, Ernest, et al.
Published: (2023)
by: van Wijland, Ernest, et al.
Published: (2023)
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
by: Bhore, Sujoy, et al.
Published: (2023)
by: Bhore, Sujoy, et al.
Published: (2023)
Efficient Algorithms and Implementations for Extracting Maximum-Size $(k,\ell)$-Sparse Subgraphs
by: Madarasi, Péter
Published: (2025)
by: Madarasi, Péter
Published: (2025)
Dynamic and Streaming Algorithms for Union Volume Estimation
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Approximation Algorithms for Smallest Intersecting Balls
by: Zheng, Jiaqi, et al.
Published: (2024)
by: Zheng, Jiaqi, et al.
Published: (2024)
Light Spanners with Small Hop-Diameter
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
Faster exponential algorithms for cut problems via geometric data structures
by: Kozma, László, et al.
Published: (2025)
by: Kozma, László, et al.
Published: (2025)
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
by: Depian, Thomas, et al.
Published: (2025)
by: Depian, Thomas, et al.
Published: (2025)
A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
by: Gusain, Rachana, et al.
Published: (2025)
by: Gusain, Rachana, et al.
Published: (2025)
Counting Unit Circular Arc Intersections
by: Wang, Haitao
Published: (2026)
by: Wang, Haitao
Published: (2026)
Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
by: Nekrich, Yakov, et al.
Published: (2026)
by: Nekrich, Yakov, et al.
Published: (2026)
Upward-Planar Drawings with Bounded Span
by: Angelini, Patrizio, et al.
Published: (2026)
by: Angelini, Patrizio, et al.
Published: (2026)
Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
by: Park, Seongbin, et al.
Published: (2026)
by: Park, Seongbin, et al.
Published: (2026)
Similar Items
-
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
by: Bandyapadhyay, Sayan, et al.
Published: (2023) -
Maintaining Light Spanners via Minimal Updates
by: Khodabandeh, Hadi, et al.
Published: (2024) -
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
by: Dobler, Alexander, et al.
Published: (2024) -
Coresets for Constrained Clustering: General Assignment Constraints and Improved Size Bounds
by: Huang, Lingxiao, et al.
Published: (2023) -
Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
by: Fomin, Fedor V., et al.
Published: (2025)