Copertina

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Emmerich, Michael T. M., Pereverdieva, Ksenia, Deutz, André
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Computational Geometry Computational Complexity Optimization and Control 68Q17, 68W05, 90C27, 68U05, 52C15 F.2.2; F.1.3; G.2.1; G.1.6
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
di: Emmerich, Michael T. M., et al.
Pubblicazione: (2026)

Selecting a Maximum Solow-Polasky Diversity Subset in General Metric Spaces Is NP-hard
di: Emmerich, Michael T. M., et al.
Pubblicazione: (2026)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
di: Emmerich, Michael T. M.
Pubblicazione: (2026)

Dichotomy for orderings?
di: Kun, Gábor, et al.
Pubblicazione: (2025)

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

On the Diameter of Arrangements of Topological Disks
di: Abiad, Aida, et al.
Pubblicazione: (2025)

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

An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources
di: Anagnostopoulos, Theodoros, et al.
Pubblicazione: (2026)

On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
di: Ameli, Afrouz Jabal, et al.
Pubblicazione: (2024)

An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
di: Flores-Peñaloza, David, et al.
Pubblicazione: (2024)

On (In)approximability of MaxMin Independent Set Reconfiguration
di: Hoang, Hung P., et al.
Pubblicazione: (2026)

Finding Complex Patterns in Trajectory Data via Geometric Set Cover
di: Conradi, Jacobus, et al.
Pubblicazione: (2023)

Computing shortest closed curves on non-orientable surfaces
di: Bulavka, Denys, et al.
Pubblicazione: (2024)

On the difficulty of order constrained pattern matching with applications to feature matching based malware detection
di: Liyanage, Adiesha, et al.
Pubblicazione: (2025)

On the Average-Case Performance of Greedy for Maximum Coverage
di: Balkanski, Eric, et al.
Pubblicazione: (2026)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
di: Rockel-Wolff, Benjamin
Pubblicazione: (2024)

Examples of slow convergence for adaptive regularization optimization methods are not isolated
di: Toint, Philippe L.
Pubblicazione: (2024)

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$
di: Gratton, Serge, et al.
Pubblicazione: (2024)

An Improved Drift Theorem for Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2023)

DAG Scheduling in the BSP Model
di: Papp, Pál András, et al.
Pubblicazione: (2023)

Packing, Hitting, and Colouring Squares
di: Caoduro, Marco, et al.
Pubblicazione: (2022)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
di: Buchbinder, Niv, et al.
Pubblicazione: (2024)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
di: Bannach, Max, et al.
Pubblicazione: (2025)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
di: Golovach, Petr A., et al.
Pubblicazione: (2022)

No Traffic to Cry: Traffic-Oblivious Link Deactivation for Green Traffic Engineering
di: Ilsen, Max, et al.
Pubblicazione: (2026)

The Subspace Flatness Conjecture and Faster Integer Programming
di: Reis, Victor, et al.
Pubblicazione: (2023)

From approximate to exact integer programming
di: Dadush, Daniel, et al.
Pubblicazione: (2022)

An asymptotically optimal algorithm for generating bin cardinalities
di: Devroye, Luc, et al.
Pubblicazione: (2024)

Data-Adaptive Low-Rank Sparse Subspace Clustering
di: Kopriva, Ivica
Pubblicazione: (2025)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
di: Ali, Alejandro Mata
Pubblicazione: (2025)

Algorithmic Barriers to Detecting and Repairing Structural Overspecification in Adaptive Data-Structure Selection
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
di: Kumar, Mrinal, et al.
Pubblicazione: (2018)

Primal-Dual Sample Complexity Bounds for Constrained Markov Decision Processes with Multiple Constraints
di: Buckley, Max, et al.
Pubblicazione: (2025)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
di: Zhong, Xianghui
Pubblicazione: (2018)

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
di: Wulf, Lasse
Pubblicazione: (2025)

Folding One Polyhedral Metric Graph into Another
di: Chung, Lily, et al.
Pubblicazione: (2024)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

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

A Constant-factor Approximation for Weighted Bond Cover
di: Kim, Eun Jung, et al.
Pubblicazione: (2021)

The Gallai Vertex Problem is $Θ_2^p$-Complete
di: Nikabadi, Amir, et al.
Pubblicazione: (2026)