Copertina

Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Friedl, Katalin, Nemkin, Viktória, Tóbiás, András
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Probability 68Q25, 68W40, 60K05, 92D15
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Optimal non-adaptive algorithm for edge estimation
di: Bishnu, Arijit, et al.
Pubblicazione: (2025)

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

Fundamentals of Partial Rejection Sampling
di: Jerrum, Mark
Pubblicazione: (2021)

Optimal Hardness of Online Algorithms for Large Independent Sets
di: Gamarnik, David, et al.
Pubblicazione: (2025)

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

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

Computing the probability of intersection
di: Barvinok, Alexander
Pubblicazione: (2025)

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

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

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

Algorithms for Generating Small Random Samples
di: Cicirello, Vincent A.
Pubblicazione: (2024)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
di: Liu, Bowen
Pubblicazione: (2025)

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

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

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

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

Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs
di: Cheairi, Houssam El, et al.
Pubblicazione: (2024)

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

On Extended Concentration Inequalities for Fast JL Embeddings of Infinite Sets
di: Boahen, Edem, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

Fast Dimensionality Reduction from $\ell_2$ to $\ell_p$
di: Chiclana, Rafael, et al.
Pubblicazione: (2025)

On the Average Runtime of an Open Source Binomial Random Variate Generation Algorithm
di: Cicirello, Vincent A.
Pubblicazione: (2024)

Many Objective Problems Where Crossover is Provably Essential
di: Opris, Andre
Pubblicazione: (2024)

Convergence of the QuickVal Residual
di: Fill, James Allen, et al.
Pubblicazione: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
di: Gupta, Swati, et al.
Pubblicazione: (2026)

The Distributional Tail of Worst-Case Quickselect
di: Płecha, Witold
Pubblicazione: (2026)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
di: Chiarini, Alberto, et al.
Pubblicazione: (2024)

An Algorithm to Recover Shredded Random Matrices
di: Atamanchuk, Caelan, et al.
Pubblicazione: (2023)

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)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
di: Feldman, Moran, et al.
Pubblicazione: (2026)

A scalable clustering algorithm to approximate graph cuts
di: Suchan, Leo, et al.
Pubblicazione: (2023)

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