Copertina

Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kar, Debajyoti, Khan, Arindam, Wiese, Andreas
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms Computational Geometry
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Improved Approximation Algorithms for Three-Dimensional Bin Packing
di: Kar, Debajyoti, et al.
Pubblicazione: (2025)

Improved Approximation Algorithms for Three-Dimensional Knapsack
di: Jansen, Klaus, et al.
Pubblicazione: (2025)

Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
di: Buchem, Moritz, et al.
Pubblicazione: (2024)

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

Faster Approximation Scheme for Euclidean $k$-TSP
di: van Wijland, Ernest, et al.
Pubblicazione: (2023)

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
di: Gadekar, Ameet, et al.
Pubblicazione: (2025)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
di: Kisfaludi-Bak, Sándor, et al.
Pubblicazione: (2026)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
di: Galby, Esther, et al.
Pubblicazione: (2023)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
di: Grandoni, Fabrizio, et al.
Pubblicazione: (2026)

An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
di: Bandyapadhyay, Sayan, et al.
Pubblicazione: (2024)

On Approximating the Weighted Region Problem in Square Tessellations
di: Kakimura, Naonori, et al.
Pubblicazione: (2024)

Data Structures for Approximate Discrete Fréchet Distance
di: van der Hoog, Ivor, et al.
Pubblicazione: (2022)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
di: Kisfaludi-Bak, Sándor, et al.
Pubblicazione: (2020)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
di: Bhore, Sujoy, et al.
Pubblicazione: (2024)

On Approximating the Dynamic and Discrete Network Flow Problem
di: Manna, Bubai, et al.
Pubblicazione: (2024)

Parameterized Approximation of Rectangle Stabbing
di: Chu, Huairui, et al.
Pubblicazione: (2026)

Adversarially Robust Approximate Furthest Neighbor
di: Banihashem, Kiarash, et al.
Pubblicazione: (2026)

Approximation Algorithms for Smallest Intersecting Balls
di: Zheng, Jiaqi, et al.
Pubblicazione: (2024)

Approximately: Independence Implies Vertex Cover
di: Har-Peled, Sariel
Pubblicazione: (2023)

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

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
di: Bringmann, Karl, et al.
Pubblicazione: (2024)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
di: Liu, Shuilian, et al.
Pubblicazione: (2025)

Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
di: Cheng, Siu-Wing, et al.
Pubblicazione: (2025)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
di: Chen, Lin, et al.
Pubblicazione: (2026)

Dominance for Containment Problems
di: Akram, Waseem, et al.
Pubblicazione: (2022)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
di: Ebbens, Matthijs, et al.
Pubblicazione: (2024)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
di: Bandyapadhyay, Sayan, et al.
Pubblicazione: (2023)

Range Counting Oracles for Geometric Problems
di: Driemel, Anne, et al.
Pubblicazione: (2025)

Algorithms for Halfplane Coverage and Related Problems
di: Wang, Haitao, et al.
Pubblicazione: (2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2024)

Improved Algorithms for Distance Selection and Related Problems
di: Wang, Haitao, et al.
Pubblicazione: (2023)

On the Complexity of the Ordered Covering Problem in Distance Geometry
di: Souza, Michael, et al.
Pubblicazione: (2025)

On the Line-Separable Unit-Disk Coverage and Related Problems
di: Liu, Gang, et al.
Pubblicazione: (2023)

Single-Source Shortest Path Problem in Weighted Disk Graphs
di: An, Shinwoo, et al.
Pubblicazione: (2025)

The Contiguous Art Gallery Problem is in Θ(n log n)
di: de Berg, Sarita, et al.
Pubblicazione: (2025)

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
di: Bartlmae, Simon, et al.
Pubblicazione: (2024)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
di: Marin, Malory, et al.
Pubblicazione: (2025)

On Line-Separable Weighted Unit-Disk Coverage and Related Problems
di: Liu, Gang, et al.
Pubblicazione: (2024)

Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond
di: Keil, J. Mark, et al.
Pubblicazione: (2024)

Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs
di: Banik, Aritra, et al.
Pubblicazione: (2025)