:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chagas, Vítor Gomes, Dell'Arriva, Elisa, Miyazawa, Flávio Keidi
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry 68W25
Online Access:	https://arxiv.org/abs/2405.00246
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Robust Classification of Dynamic Bichromatic point Sets in R2
by: Glazenburg, Erwin, et al.
Published: (2024)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
by: Conradi, Jacobus, et al.
Published: (2025)

Curvature surfaces in generic conformally flat hypersurfaces arising from Poincaré metric -- Extension and Approximation
by: Matsuura, Nozomu, et al.
Published: (2023)

Improved Approximation Algorithms for the Expanding Search Problem
by: Griesbach, Svenja M., et al.
Published: (2023)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
by: Andreou, Pantelis, et al.
Published: (2024)

$(1+\varepsilon)$-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension
by: Conradi, Jacobus, et al.
Published: (2023)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
by: Gu, Qian-Ping, et al.
Published: (2025)

The Quadratic Bin Packing Problem: Exact Formulations and Algorithm
by: Chagas, Vítor Gomes, et al.
Published: (2026)

Revisiting Sampson Approximations for Geometric Estimation Problems
by: Rydell, Felix, et al.
Published: (2024)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
by: Grobben, Kobe, et al.
Published: (2025)

Approximating k-Center via Farthest-First on $δ$-Covers
by: Wilson, Jason R.
Published: (2026)

Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation
by: Gravin, Nickolai, et al.
Published: (2023)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

Optimal Discretization is Fixed-parameter Tractable
by: Kratsch, Stefan, et al.
Published: (2020)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls
by: Bigham, Bahram Sadeghi
Published: (2021)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2026)

The Telephone $k$-Multicast Problem
by: Hathcock, Daniel, et al.
Published: (2024)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Sum-of-Gaussians tensor neural networks for high-dimensional Schrödinger equation
by: Zhou, Qi, et al.
Published: (2025)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
by: Bai, Miao, et al.
Published: (2023)

Multipole Semantic Attention: A Fast Approximation of Softmax Attention for Pretraining
by: Mitchell, Rupert, et al.
Published: (2025)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2025)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
by: Cai, HanQin, et al.
Published: (2023)

On sampling two spin models using the local connective constant
by: Efthymiou, Charilaos
Published: (2024)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
by: López, Francisco, et al.
Published: (2023)

Certified Real Eigenvalue Location
by: Solmaz, Baran, et al.
Published: (2026)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Point Location in Constant Time
by: Chaganti, Sairam, et al.
Published: (2023)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)

Adaptive Approximation Schemes for Matching Queues
by: AmaniHamedani, Alireza, et al.
Published: (2025)