Image de couverture de livre

A Framework for Efficient Approximation Schemes on Geometric Packing Problems of $d$-dimensional Fat Objects

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chagas, Vítor Gomes, Dell'Arriva, Elisa, Miyazawa, Flávio Keidi
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry 68W25
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Robust Classification of Dynamic Bichromatic point Sets in R2
par: Glazenburg, Erwin, et autres
Publié: (2024)

Random-Order Online Independent Set of Intervals and Hyperrectangles
par: Garg, Mohit, et autres
Publié: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

Improved Approximation Algorithms for the Expanding Search Problem
par: Griesbach, Svenja M., et autres
Publié: (2023)

Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
par: Conradi, Jacobus, et autres
Publié: (2025)

The Bottom-Left Algorithm for the Strip Packing Problem
par: Hougardy, Stefan, et autres
Publié: (2024)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
par: Gu, Qian-Ping, et autres
Publié: (2025)

Curvature surfaces in generic conformally flat hypersurfaces arising from Poincaré metric -- Extension and Approximation
par: Matsuura, Nozomu, et autres
Publié: (2023)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
par: Andreou, Pantelis, et autres
Publié: (2024)

$(1+\varepsilon)$-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension
par: Conradi, Jacobus, et autres
Publié: (2023)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
par: Grobben, Kobe, et autres
Publié: (2025)

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

Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation
par: Gravin, Nickolai, et autres
Publié: (2023)

Revisiting Sampson Approximations for Geometric Estimation Problems
par: Rydell, Felix, et autres
Publié: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
par: Friggstad, Zachary, et autres
Publié: (2018)

The Telephone $k$-Multicast Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

Runtime Analyses of NSGA-III on Many-Objective Problems
par: Opris, Andre, et autres
Publié: (2024)

Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls
par: Bigham, Bahram Sadeghi
Publié: (2021)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2026)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
par: Bai, Miao, et autres
Publié: (2023)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Optimal Discretization is Fixed-parameter Tractable
par: Kratsch, Stefan, et autres
Publié: (2020)

The Quadratic Bin Packing Problem: Exact Formulations and Algorithm
par: Chagas, Vítor Gomes, et autres
Publié: (2026)

Strongly Sublinear Algorithms for Testing Pattern Freeness
par: Newman, Ilan, et autres
Publié: (2021)

On sampling two spin models using the local connective constant
par: Efthymiou, Charilaos
Publié: (2024)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
par: Cai, HanQin, et autres
Publié: (2023)

Sum-of-Gaussians tensor neural networks for high-dimensional Schrödinger equation
par: Zhou, Qi, et autres
Publié: (2025)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
par: López, Francisco, et autres
Publié: (2023)

Multipole Semantic Attention: A Fast Approximation of Softmax Attention for Pretraining
par: Mitchell, Rupert, et autres
Publié: (2025)

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

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Point Location in Constant Time
par: Chaganti, Sairam, et autres
Publié: (2023)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

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

On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs
par: Efthymiou, Charilaos
Publié: (2020)

Euclidean k-center Fair Clusterings
par: Moritaka, Ayano, et autres
Publié: (2025)

On strictly output sensitive color frequency reporting
par: Glazenburg, Erwin, et autres
Publié: (2026)

Certified Real Eigenvalue Location
par: Solmaz, Baran, et autres
Publié: (2026)