Imagen de Portada

Approximating Pareto Sum via Bounded Monotone Min-Plus Convolution

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gokaj, Geri, Künnemann, Marvin, Storandt, Sabine, Truschel, Carina
Formato:	Preprint
Publicado:	2026
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic
por: Gokaj, Geri, et al.
Publicado: (2025)

Computing $L_\infty$ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness
por: Angrick, Sebastian, et al.
Publicado: (2026)

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
por: Funke, Daniel, et al.
Publicado: (2024)

Continuous Map Matching to Paths under Travel Time Constraints
por: Bosch, Yannick, et al.
Publicado: (2025)

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

On Approximability of $\ell_2^2$ Min-Sum Clustering
por: S., Karthik C., et al.
Publicado: (2024)

Near-Optimal Min-Sum Motion Planning in a Planar Polygonal Environment
por: Agarwal, Pankaj K., et al.
Publicado: (2025)

Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection
por: Dudek, Bartłomiej, et al.
Publicado: (2026)

Deterministic Monotone Min-Plus Product and Convolution
por: Jin, Ce, et al.
Publicado: (2026)

Tropical Geometry Based Edge Detection Using Min-Plus and Max-Plus Algebra
por: S, Shivam Kumar Jha, et al.
Publicado: (2025)

Variable Min-Cut Max-Flow Bounds and Algorithms in Finite Regime
por: Gitik, Rivka, et al.
Publicado: (2025)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
por: de Berg, Sarita, et al.
Publicado: (2026)

Witness Set in Monotone Polygons: Exact and Approximate
por: Das, Udvas, et al.
Publicado: (2025)

Disk and Partial Disk Inspection: Worst- to Average-Case and Pareto Upper Bounds
por: Conley, James, et al.
Publicado: (2024)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Optimal Area-Sensitive Bounds for Polytope Approximation
por: Arya, Sunil, et al.
Publicado: (2023)

Optimal Volume-Sensitive Bounds for Polytope Approximation
por: Arya, Sunil, et al.
Publicado: (2023)

Approximation Algorithms for Minimum Sum of Moving-Distance and Opening-Costs Target Coverage Problem
por: Zhao, Lei, et al.
Publicado: (2024)

Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
por: Bringmann, Karl, et al.
Publicado: (2024)

Min-$k$-planar Drawings of Graphs
por: Binucci, Carla, et al.
Publicado: (2023)

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

Approximate Min-Sum Subset Convolution
por: Stoian, Mihail
Publicado: (2024)

Improved Bounds for Rectangular Monotone Min-Plus Product and Applications
por: Dürr, Anita
Publicado: (2022)

Minimum Monotone Spanning Trees
por: Di Giacomo, Emilio, et al.
Publicado: (2024)

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

ParkView: Visualizing Monotone Interleavings
por: Beurskens, Thijs, et al.
Publicado: (2025)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
por: Barequet, Gill, et al.
Publicado: (2025)

Retroactive Monotonic Priority Queues via Range Searching
por: Castro, Lucas, et al.
Publicado: (2025)

Min-1-Planarity is NP-Hard
por: Okada, Yuto
Publicado: (2026)

Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
por: Barequet, Gill, et al.
Publicado: (2025)

Approximating Convex Hulls via Range Queries
por: Schibler, T., et al.
Publicado: (2026)

Improved Bound on the Number of Pseudoline Arrangements via the Zone Theorem
por: Dallant, Justin
Publicado: (2025)

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

Approximating Gromov-Hausdorff Distance in Euclidean Space
por: Majhi, Sushovan, et al.
Publicado: (2019)

Upward-Planar Drawings with Bounded Span
por: Angelini, Patrizio, et al.
Publicado: (2026)

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
por: Bringmann, Karl, et al.
Publicado: (2023)

On Extremal Properties of k-CNF: Capturing Threshold Functions
por: Gurumukhani, Mohit, et al.
Publicado: (2024)

On a Geometric Interpretation Of the Subset Sum Problem
por: Costandin, Marius
Publicado: (2024)

Stability and Approximations for Decorated Reeb Spaces
por: Curry, Justin, et al.
Publicado: (2023)

Approximating the Directed Hausdorff Distance
por: Chubet, Oliver A., et al.
Publicado: (2025)