Saved in:
| Main Author: | Clément, François |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.18132 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem
by: Clément, François, et al.
Published: (2024)
by: Clément, François, et al.
Published: (2024)
Constructing Optimal $L_{\infty}$ Star Discrepancy Sets
by: Clément, François, et al.
Published: (2023)
by: Clément, François, et al.
Published: (2023)
Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection
by: Clément, François, et al.
Published: (2023)
by: Clément, François, et al.
Published: (2023)
Optimizing Kernel Discrepancies via Subset Selection
by: Chen, Deyao, et al.
Published: (2025)
by: Chen, Deyao, et al.
Published: (2025)
Simple Construction of Greedy Trees and Greedy Permutations
by: Chubet, Oliver, et al.
Published: (2024)
by: Chubet, Oliver, et al.
Published: (2024)
A Greedy Algorithm for Low-Crossing Partitions for General Set Systems
by: Csikós, Mónika, et al.
Published: (2025)
by: Csikós, Mónika, et al.
Published: (2025)
Greedy Monochromatic Island Partitions
by: Broek, Steven van den, et al.
Published: (2024)
by: Broek, Steven van den, et al.
Published: (2024)
Greedy Routing Reachability Games
by: Lenzner, Pascal, et al.
Published: (2026)
by: Lenzner, Pascal, et al.
Published: (2026)
Algorithms for Standard-form ILP Problems via Komlós' Discrepancy Setting
by: Gribanov, Dmitry, et al.
Published: (2026)
by: Gribanov, Dmitry, et al.
Published: (2026)
Efficient Greedy Discrete Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2025)
by: van der Hoog, Ivor, et al.
Published: (2025)
A New Approach to the Construction of Subdivision Algorithms
by: Dietz, Alexander
Published: (2025)
by: Dietz, Alexander
Published: (2025)
Decremental Greedy Polygons and Polyhedra Without Sharp Angles
by: Eppstein, David
Published: (2025)
by: Eppstein, David
Published: (2025)
Obtaining the Chamanara Surface from the van der Corput sequence
by: Chowdhury, Zawad, et al.
Published: (2025)
by: Chowdhury, Zawad, et al.
Published: (2025)
Diagonal Frobenius Number via Gomory's Relaxation and Discrepancy
by: Gribanov, Dmitry, et al.
Published: (2025)
by: Gribanov, Dmitry, et al.
Published: (2025)
Scalable GPU Construction of 3D Voronoi and Power Diagrams
by: Taveira, Bernardo, et al.
Published: (2026)
by: Taveira, Bernardo, et al.
Published: (2026)
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
by: Le, Hung, et al.
Published: (2021)
by: Le, Hung, et al.
Published: (2021)
MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
by: Zhou, Yi, et al.
Published: (2026)
by: Zhou, Yi, et al.
Published: (2026)
A fast algorithm for the Hecke representation of the braid group, and applications to the computation of the HOMFLY-PT polynomial and the search for interesting braids
by: Maria, Clément, et al.
Published: (2025)
by: Maria, Clément, et al.
Published: (2025)
On Sparse Representations of 3-Manifolds
by: Huszár, Kristóf, et al.
Published: (2025)
by: Huszár, Kristóf, et al.
Published: (2025)
Hardness of computation of quantum invariants on 3-manifolds with restricted topology
by: Ennes, Henrique, et al.
Published: (2025)
by: Ennes, Henrique, et al.
Published: (2025)
Wu's Method can Boost Symbolic AI to Rival Silver Medalists and AlphaGeometry to Outperform Gold Medalists at IMO Geometry
by: Sinha, Shiven, et al.
Published: (2024)
by: Sinha, Shiven, et al.
Published: (2024)
Algorithms for orthogonal partitioning into four parts
by: Fakhrutdinov, Alexey, et al.
Published: (2025)
by: Fakhrutdinov, Alexey, et al.
Published: (2025)
Best of two worlds: Cartesian sampling and volume computation for distance-constrained configuration spaces using Cayley coordinates
by: Zhang, Yichi, et al.
Published: (2024)
by: Zhang, Yichi, et al.
Published: (2024)
New Constructions of SSPDs and their Applications
by: Abam, Mohammad A., et al.
Published: (2025)
by: Abam, Mohammad A., et al.
Published: (2025)
Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
by: Raulet, Gabriel, et al.
Published: (2025)
by: Raulet, Gabriel, et al.
Published: (2025)
A Couple of Simple Algorithms for $k$-Dispersion
by: Chen, Ke, et al.
Published: (2025)
by: Chen, Ke, et al.
Published: (2025)
Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)
by: Chung, Chaeyoon, et al.
Published: (2026)
Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations
by: Goodrich, Michael T., et al.
Published: (2025)
by: Goodrich, Michael T., et al.
Published: (2025)
Well-quasi-orders on embedded planar graphs
by: Lunel, Corentin, et al.
Published: (2025)
by: Lunel, Corentin, et al.
Published: (2025)
Constructing Interlocking Assemblies with Crystallographic Symmetries
by: Goertzen, Tom
Published: (2024)
by: Goertzen, Tom
Published: (2024)
Integrable Frame Fields using Odeco Tensors
by: Couplet, Mattéo, et al.
Published: (2024)
by: Couplet, Mattéo, et al.
Published: (2024)
Gromov-Wasserstein at Scale, Beyond Squared Norms
by: Houry, Guillaume, et al.
Published: (2026)
by: Houry, Guillaume, et al.
Published: (2026)
Approximation Algorithms for Anchored Multiwatchman Routes
by: Mitchell, Joseph S. B., et al.
Published: (2024)
by: Mitchell, Joseph S. B., et al.
Published: (2024)
Algorithms for Dynamic Computational Geometry with Applications
by: Boxer, Laurence
Published: (2025)
by: Boxer, Laurence
Published: (2025)
Exact Algorithms for Minimum Dilation Triangulation
by: Fekete, Sándor P., et al.
Published: (2025)
by: Fekete, Sándor P., et al.
Published: (2025)
Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications
by: Aronov, Boris, et al.
Published: (2019)
by: Aronov, Boris, et al.
Published: (2019)
Localized Evaluation for Constructing Discrete Vector Fields
by: Finken, Tanner, et al.
Published: (2024)
by: Finken, Tanner, et al.
Published: (2024)
Polylogarithmic Full-Chord Buffon Discrepancy
by: Korsky, Samuel
Published: (2026)
by: Korsky, Samuel
Published: (2026)
Optimistic Imprecise Shortest Watchtower in 1.5D and 2.5D
by: McCoy, Bradley, et al.
Published: (2026)
by: McCoy, Bradley, et al.
Published: (2026)
On Stable Approximation Algorithms for Geometric Coverage Problems
by: de Berg, Mark, et al.
Published: (2024)
by: de Berg, Mark, et al.
Published: (2024)
Similar Items
-
Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem
by: Clément, François, et al.
Published: (2024) -
Constructing Optimal $L_{\infty}$ Star Discrepancy Sets
by: Clément, François, et al.
Published: (2023) -
Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection
by: Clément, François, et al.
Published: (2023) -
Optimizing Kernel Discrepancies via Subset Selection
by: Chen, Deyao, et al.
Published: (2025) -
Simple Construction of Greedy Trees and Greedy Permutations
by: Chubet, Oliver, et al.
Published: (2024)