Cover Image

Quasi-Monte Carlo Beyond Hardy-Krause

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bansal, Nikhil, Jiang, Haotian
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computational Geometry Discrete Mathematics Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
by: Bansal, Nikhil, et al.
Published: (2025)

An Improved Bound for the Beck-Fiala Conjecture
by: Bansal, Nikhil, et al.
Published: (2025)

On Tight Robust Coresets for $k$-Medians Clustering
by: Huang, Lingxiao, et al.
Published: (2025)

Upward Pointset Embeddings of Planar st-Graphs
by: Alegria, Carlos, et al.
Published: (2024)

Freeze-Tag in $L_1$ has Wake-up Time Five
by: Bonichon, Nicolas, et al.
Published: (2024)

Slant/Gokigen Naname is NP-complete, and Some Variations are in P
by: Lynch, Jayson, et al.
Published: (2025)

Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
by: Yang, Puhan, et al.
Published: (2025)

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

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
by: Bentert, Matthias, et al.
Published: (2025)

Simple Compact Monotone Tree Drawings
by: Oikonomou, Anargyros, et al.
Published: (2017)

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
by: Hengeveld, Simon, et al.
Published: (2020)

Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
by: Spalding-Jamieson, Jack
Published: (2025)

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
by: Di Battista, Giuseppe, et al.
Published: (2021)

Distance Approximating Minors for Planar and Minor-Free Graphs
by: Chang, Hsien-Chih, et al.
Published: (2025)

An algorithm for accurate and simple-looking metaphorical maps
by: Katsanou, Eleni, et al.
Published: (2025)

A Polynomial Coreset for Furthest Neighbor in Planar Metrics
by: Kluk, Kacper, et al.
Published: (2026)

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
by: Förster, Henry, et al.
Published: (2023)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
by: Fomin, Fedor V., et al.
Published: (2026)

Online Graph Balancing and the Power of Two Choices
by: Bansal, Nikhil, et al.
Published: (2026)

Efficient Algorithms and Implementations for Extracting Maximum-Size $(k,\ell)$-Sparse Subgraphs
by: Madarasi, Péter
Published: (2025)

Implicit representations via the polynomial method
by: Cardinal, Jean, et al.
Published: (2026)

A New and Faster Representation for Counting Integer Points in Parametric Polyhedra
by: Gribanov, D., et al.
Published: (2023)

Quadratic-Time Algorithm for the Maximum-Weight $(k, \ell)$-Sparse Subgraph Problem
by: Deák, Bence, et al.
Published: (2025)

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
by: Dutta, Kunal, et al.
Published: (2026)

An Approximate Generalization of the Okamura-Seymour Theorem
by: Kumar, Nikhil
Published: (2022)

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
by: Abrahamsen, Mikkel, et al.
Published: (2020)

Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity
by: Gajjar, Kshitij, et al.
Published: (2026)

Ranking with Multiple Objectives
by: Devanur, Nikhil R., et al.
Published: (2024)

O(1)-Distortion Planar Emulators for String Graphs
by: Chang, Hsien-Chih, et al.
Published: (2025)

Solving the Multiobjective Quasi-Clique Problem
by: Santos, Daniela Scherer dos, et al.
Published: (2024)

Twice-Ramanujan Sparsifiers
by: Batson, Joshua, et al.
Published: (2008)

Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time
by: Hofman, Radoslaw
Published: (2006)

The Squishy Grid Problem
by: Cai, Zixi, et al.
Published: (2025)

Edge Clique Partition and Cover Beyond Independence
by: Fomin, Fedor V., et al.
Published: (2025)

Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra
by: Dakhno, Grigorii, et al.
Published: (2024)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
by: Dorfer, Joseph
Published: (2026)

Optimal Generation of Strictly Increasing Binary Trees and Beyond
by: Bodini, Olivier, et al.
Published: (2024)

Optimal Padded Decomposition For Bounded Treewidth Graphs
by: Filtser, Arnold, et al.
Published: (2024)

Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents
by: Georgiou, Konstantinos, et al.
Published: (2025)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
by: Elbassioni, Khaled
Published: (2025)