Imagen de Portada

Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Høgemo, Svein
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms G.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Lower Bounds for Leaf Rank of Leaf Powers
por: Høgemo, Svein
Publicado: (2024)

Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
por: Szyfelbein, Michał
Publicado: (2025)

Approximation Algorithms for Action-Reward Query-Commit Matching
por: Derakhshan, Mahsa, et al.
Publicado: (2026)

Deterministic Minimum Steiner Cut in Maximum Flow Time
por: Ding, Matthew, et al.
Publicado: (2023)

Fast and Simple Sorting Using Partial Information
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
por: Kumar, Nikhil, et al.
Publicado: (2025)

Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries
por: Kaudan, Chirag, et al.
Publicado: (2026)

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
por: Kumar, Nikhil, et al.
Publicado: (2025)

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

Engineering Algorithms for $\ell$-Isolated Maximal Clique Enumeration
por: D'Elia, Marco, et al.
Publicado: (2025)

Speeding-up Graph Algorithms via Clique Partitioning
por: Chavan, Akshar, et al.
Publicado: (2025)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
por: Balzotti, Lorenzo
Publicado: (2020)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
por: Ibrahimpur, Sharat, et al.
Publicado: (2025)

Finding Diverse Minimum s-t Cuts
por: de Berg, Mark, et al.
Publicado: (2023)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
por: Dvořák, Pavel, et al.
Publicado: (2017)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
por: Dreier, Jan, et al.
Publicado: (2026)

A Tight Lower Bound for Comparison-Based Quantile Summaries
por: Cormode, Graham, et al.
Publicado: (2019)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
por: Dabrowski, Konrad K., et al.
Publicado: (2024)

Structural Parameterization of Steiner Tree Packing
por: Hastrich, Niko, et al.
Publicado: (2025)

A Simple yet Exact Analysis of the MultiQueue
por: Walzer, Stefan, et al.
Publicado: (2024)

On the Node-Averaged Complexity of Locally Checkable Problems on Trees
por: Balliu, Alkida, et al.
Publicado: (2023)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
por: Bergougnoux, Benjamin, et al.
Publicado: (2026)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
por: DeHaan, Ian, et al.
Publicado: (2024)

The planar edge-coloring theorem of Vizing in $O(n\log n)$ time
por: Jędrzejczak, Patryk, et al.
Publicado: (2025)

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

Approximation Algorithms for Correlated Knapsack Orienteering
por: Espinosa, David Aleman, et al.
Publicado: (2024)

Searching in trees with $k$-up-modular cost functions
por: Szyfelbein, Michał
Publicado: (2025)

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

A Piecewise Approach for the Analysis of Exact Algorithms
por: Clinch, Katie, et al.
Publicado: (2024)

Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
por: Marica, Edina, et al.
Publicado: (2026)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

JFR: An Efficient Jump Frontier Relaxation Strategy for Bellman-Ford
por: Wang, Xin, et al.
Publicado: (2025)

Customizable Contraction Hierarchies -- A Survey
por: Bläsius, Thomas, et al.
Publicado: (2025)

Maintaining Routing Structures under Deletions via Self-Pruning
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
por: Haeupler, Bernhard, et al.
Publicado: (2023)

Faster shortest-path algorithms using the acyclic-connected tree
por: Stefansson, Elis, et al.
Publicado: (2025)

Graph Threading
por: Demaine, Erik D., et al.
Publicado: (2023)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
por: Chen, Yongyu
Publicado: (2023)

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
por: Liao, Chao, et al.
Publicado: (2022)