Imagen de Portada

Limited Perfect Monotonical Surrogates constructed using low-cost recursive linkage discovery with guaranteed output

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Przewozniczek, M. W., Chicano, F., Tinós, R., Komarnicki, M. M.
Formato:	Preprint
Publicado:	2026
Materias:	Artificial Intelligence Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Simplified Tight Bounds for Monotone Minimal Perfect Hashing
por: Kosolobov, Dmitry
Publicado: (2024)

Submodular Ground-Set Pruning: Monotone Tightness and a Non-Monotone Separation
por: Kuhnle, Alan
Publicado: (2026)

Online Monotone Metric Embeddings
por: Coester, Christian, et al.
Publicado: (2026)

Monotone Submodular Multiway Partition
por: Bi, Richard, et al.
Publicado: (2024)

Better approximation guarantee for Asymmetric TSP
por: Vygen, Jens
Publicado: (2026)

Exploring Monotone Priority Queues for Dijkstra Optimization
por: Costa, Jonas, et al.
Publicado: (2024)

Testing Monotonicity of Real-Valued Functions on DAGs
por: Yoshida, Yuichi
Publicado: (2026)

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

Perfect Matchings and Popularity in the Many-to-Many Setting
por: Kavitha, Telikepalli, et al.
Publicado: (2024)

Engineering Minimal k-Perfect Hash Functions
por: Hermann, Stefan, et al.
Publicado: (2025)

On Finding $\ell$-th Smallest Perfect Matchings
por: Maalouly, Nicolas El, et al.
Publicado: (2025)

On Thin Perfect Matchings up to Polylogarithmic Factors
por: Haqi, Alireza, et al.
Publicado: (2026)

Modern Minimal Perfect Hashing: A Survey
por: Lehmann, Hans-Peter, et al.
Publicado: (2025)

On recognizing graphs representing Persistent Perfect Phylogenies
por: Bonizzoni, Paola, et al.
Publicado: (2025)

Directed Isoperimetry and Monotonicity Testing: A Dynamical Approach
por: Pinto Jr, Renato Ferreira
Publicado: (2024)

On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope
por: Nägele, Martin, et al.
Publicado: (2026)

Perfect Sampling in Turnstile Streams Beyond Small Moments
por: Woodruff, David P., et al.
Publicado: (2025)

Perfect $L_p$ Sampling with Polylogarithmic Update Time
por: Swartworth, William, et al.
Publicado: (2025)

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

Private federated discovery of out-of-vocabulary words for Gboard
por: Sun, Ziteng, et al.
Publicado: (2024)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
por: Lehmann, Hans-Peter, et al.
Publicado: (2025)

Perfect Simulation of Las Vegas Algorithms via Local Computation
por: Fu, Xinyu, et al.
Publicado: (2023)

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
por: Hermann, Stefan, et al.
Publicado: (2024)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
por: Hathcock, Daniel, et al.
Publicado: (2025)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
por: Kaul, Matthias, et al.
Publicado: (2025)

Moving between high-quality optima using multi-satisfiability characteristics in hard-to-solve Max3Sat instances
por: Piatek, J., et al.
Publicado: (2025)

Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint
por: Tran, Tan D., et al.
Publicado: (2025)

Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars
por: Olbrich, Jannik
Publicado: (2025)

Complexity of Perfect and Ideal Resilience Verification in Fast Re-Route Networks
por: Bentert, Matthias, et al.
Publicado: (2026)

Blossom VI: A Practical Minimum Weight Perfect Matching Algorithm
por: Arkhipov, Pavel, et al.
Publicado: (2026)

Scalable Fair Influence Blocking Maximization via Approximately Monotonic Submodular Optimization
por: Fang, Qiangpeng, et al.
Publicado: (2026)

Nearly Optimal Bounds for Sample-Based Testing and Learning of $k$-Monotone Functions
por: Black, Hadley
Publicado: (2023)

A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling
por: Jansen, Klaus, et al.
Publicado: (2026)

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

A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
por: Beines, Arne, et al.
Publicado: (2024)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
por: Almansoori, Mahmood K. M., et al.
Publicado: (2025)

Finding Spanning Trees with Perfect Matchings
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Universal Perfect Samplers for Incremental Streams
por: Pettie, Seth, et al.
Publicado: (2024)

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
por: Kobayashi, Yasuaki, et al.
Publicado: (2020)

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
por: Bucić, Matija, et al.
Publicado: (2025)