Image de couverture de livre

Impact of Knowledge on the Cost of Treasure Hunt in Trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bouchard, Sébastien, Labourel, Arnaud, Pelc, Andrzej
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fast approximate $\ell$-center clustering in high dimensional spaces
par: Kowaluk, Mirosław, et autres
Publié: (2025)

Multiplication of 0-1 matrices via clustering
par: Jansson, Jesper, et autres
Publié: (2025)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
par: Kowaluk, Miroslaw, et autres
Publié: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
par: Jansson, Jesper, et autres
Publié: (2024)

Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
par: Lingas, Andrzej
Publié: (2024)

Spanning Trees Minimizing Branching Costs
par: Gargano, Luisa, et autres
Publié: (2024)

Structural Parameterization of Steiner Tree Packing
par: Hastrich, Niko, et autres
Publié: (2025)

Graph Threading with Turn Costs
par: Demaine, Erik D., et autres
Publié: (2024)

On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
par: Lingas, Andrzej
Publié: (2026)

Online Combinatorial Optimization with Graphical Dependencies
par: Gao, Zhimeng, et autres
Publié: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
par: Bruchhold, Sebastian, et autres
Publié: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
par: Awofeso, Christine, et autres
Publié: (2025)

Online computation of normalized substring complexity
par: Kucherov, Gregory, et autres
Publié: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
par: Gong, Mingyang, et autres
Publié: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
par: Mosenzon, Ron
Publié: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
par: Lindermayr, Alexander, et autres
Publié: (2025)

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

Hierarchical Exponential Search Via K-Spines
par: Dong, Bob
Publié: (2025)

Simple in-place yet comparison-optimal Mergesort
par: Siebert, Christian
Publié: (2025)

Minimizing the Weighted Makespan with Restarts on a Single Machine
par: Amouzandeh, Aflatoun, et autres
Publié: (2025)

On Hardness and Approximation of Broadcasting in Structured Graphs
par: Bringolf, Jeffrey, et autres
Publié: (2025)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
par: Hommelsheim, Felix, et autres
Publié: (2025)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
par: Kanellopoulos, Sotiris, et autres
Publié: (2025)

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
par: Duan, Ran, et autres
Publié: (2025)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
par: Ahn, Jungho, et autres
Publié: (2025)

Fast Order Statistics with Group Inequality Testing
par: Liyanage, Adiesha, et autres
Publié: (2025)

PtrHash: Minimal Perfect Hashing at RAM Throughput
par: Koerkamp, Ragnar Groot
Publié: (2025)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
par: Chuzhoy, Julia, et autres
Publié: (2025)

New Sorting Algorithm Wave Sort (W-Sort)
par: Wei, Jia Xu
Publié: (2025)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
par: Bauernöppel, Frank, et autres
Publié: (2025)

Counting large patterns in degenerate graphs
par: Awofeso, Christine, et autres
Publié: (2025)

Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
par: Chen, Lin, et autres
Publié: (2025)

An improved local search based algorithm for $k^-$-star partition
par: Gong, Mingyang, et autres
Publié: (2025)

On the Approximability of Unsplittable Flow on a Path with Time Windows
par: Armbruster, Alexander, et autres
Publié: (2025)

Improving Online Bin Covering with Little Advice
par: Brodnik, Andrej, et autres
Publié: (2025)

Colorful Vertex Recoloring of Bipartite Graphs
par: Patt-Shamir, Boaz, et autres
Publié: (2025)

Offline green bin packing and its constrained variant
par: Gong, Mingyang, et autres
Publié: (2026)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
par: Blomer, Valentin, et autres
Publié: (2026)

A Faster Directed Single-Source Shortest Path Algorithm
par: Duan, Ran, et autres
Publié: (2026)

Connected Components in Linear Work and Near-Optimal Time
par: Farhadi, Alireza, et autres
Publié: (2023)