Imagen de Portada

Hierarchical Exponential Search Via K-Spines

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Dong, Bob
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

Search and evacuation with a near majority of faulty agents
por: Czyzowicz, J., et al.
Publicado: (2026)

Identity Testing for Circuits with Exponentiation Gates
por: Li, Jiatu, et al.
Publicado: (2025)

Multiplication of 0-1 matrices via clustering
por: Jansson, Jesper, et al.
Publicado: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
por: Kowaluk, Mirosław, et al.
Publicado: (2025)

Online Combinatorial Optimization with Graphical Dependencies
por: Gao, Zhimeng, et al.
Publicado: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
por: Bruchhold, Sebastian, et al.
Publicado: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
por: Awofeso, Christine, et al.
Publicado: (2025)

Online computation of normalized substring complexity
por: Kucherov, Gregory, et al.
Publicado: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
por: Gong, Mingyang, et al.
Publicado: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
por: Mosenzon, Ron
Publicado: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
por: Lindermayr, Alexander, et al.
Publicado: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
por: Emmerich, Michael
Publicado: (2025)

Simple in-place yet comparison-optimal Mergesort
por: Siebert, Christian
Publicado: (2025)

Minimizing the Weighted Makespan with Restarts on a Single Machine
por: Amouzandeh, Aflatoun, et al.
Publicado: (2025)

On Hardness and Approximation of Broadcasting in Structured Graphs
por: Bringolf, Jeffrey, et al.
Publicado: (2025)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
por: Hommelsheim, Felix, et al.
Publicado: (2025)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
por: Kanellopoulos, Sotiris, et al.
Publicado: (2025)

Impact of Knowledge on the Cost of Treasure Hunt in Trees
por: Bouchard, Sébastien, et al.
Publicado: (2025)

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
por: Duan, Ran, et al.
Publicado: (2025)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
por: Ahn, Jungho, et al.
Publicado: (2025)

Fast Order Statistics with Group Inequality Testing
por: Liyanage, Adiesha, et al.
Publicado: (2025)

PtrHash: Minimal Perfect Hashing at RAM Throughput
por: Koerkamp, Ragnar Groot
Publicado: (2025)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
por: Chuzhoy, Julia, et al.
Publicado: (2025)

New Sorting Algorithm Wave Sort (W-Sort)
por: Wei, Jia Xu
Publicado: (2025)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
por: Bauernöppel, Frank, et al.
Publicado: (2025)

Counting large patterns in degenerate graphs
por: Awofeso, Christine, et al.
Publicado: (2025)

Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
por: Chen, Lin, et al.
Publicado: (2025)

An improved local search based algorithm for $k^-$-star partition
por: Gong, Mingyang, et al.
Publicado: (2025)

On the Approximability of Unsplittable Flow on a Path with Time Windows
por: Armbruster, Alexander, et al.
Publicado: (2025)

Improving Online Bin Covering with Little Advice
por: Brodnik, Andrej, et al.
Publicado: (2025)

Colorful Vertex Recoloring of Bipartite Graphs
por: Patt-Shamir, Boaz, et al.
Publicado: (2025)

Offline green bin packing and its constrained variant
por: Gong, Mingyang, et al.
Publicado: (2026)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
por: Blomer, Valentin, et al.
Publicado: (2026)

A Faster Directed Single-Source Shortest Path Algorithm
por: Duan, Ran, et al.
Publicado: (2026)

Connected Components in Linear Work and Near-Optimal Time
por: Farhadi, Alireza, et al.
Publicado: (2023)

Online $b$-Matching with Stochastic Rewards
por: Albers, Susanne, et al.
Publicado: (2024)

On the satisfability of random k-Horn formulae
por: Istrate, Gabriel
Publicado: (2000)

Approximation algorithms for Job Scheduling with reconfigurable resources
por: Bergé, Pierre, et al.
Publicado: (2023)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
por: Antoniadis, Antonios, et al.
Publicado: (2020)