Imagen de Portada

Searching in trees with monotonic query times

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dereniowski, Dariusz, Wrosz, Izajasz
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Discrete Mathematics 68R10, 68W25 G.2.2; F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Searching by Heterogeneous Agents
por: Dereniowski, Dariusz, et al.
Publicado: (2021)

A framework for distributed discrete evacuation strategies
por: Borowiecki, Piotr, et al.
Publicado: (2025)

Interval Graphs are Reconstructible
por: Heinrich, Irene, et al.
Publicado: (2025)

Pliability and Approximating Max-CSPs
por: Romero, Miguel, et al.
Publicado: (2019)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
por: Sun, Hao
Publicado: (2023)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
por: Zhong, Xianghui
Publicado: (2019)

On the thinness of trees
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2025)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
por: Laekhanukit, Bundit
Publicado: (2024)

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

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

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
por: Gabryelski, Wojciech, et al.
Publicado: (2026)

The Bottom-Left Algorithm for the Strip Packing Problem
por: Hougardy, Stefan, et al.
Publicado: (2024)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
por: Rockel-Wolff, Benjamin
Publicado: (2024)

APTAS for bin packing with general cost structures
por: Jaykrishnan, G., et al.
Publicado: (2024)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
por: Buchbinder, Niv, et al.
Publicado: (2024)

Fairness in the k-Server Problem
por: Daneshvaramoli, Mohammadreza, et al.
Publicado: (2025)

Bicriteria Submodular Maximization
por: Feldman, Moran, et al.
Publicado: (2025)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
por: Mundhra, S.
Publicado: (2025)

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

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
por: Buchbinder, Niv, et al.
Publicado: (2024)

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

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
por: Heimann, Sophia, et al.
Publicado: (2026)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
por: Michel, Stefan
Publicado: (2025)

On the twin-width of near-regular graphs
por: Heinrich, Irene, et al.
Publicado: (2025)

Temporalizing digraphs via linear-size balanced bi-trees
por: Bessy, Stéphane, et al.
Publicado: (2023)

Adjacency Labeling Schemes for Small Classes
por: Bonnet, Édouard, et al.
Publicado: (2024)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
por: Filmus, Yuval, et al.
Publicado: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
por: An, Hyung-Chan, et al.
Publicado: (2025)

Exact Algorithms for MaxCut on Split Graphs
por: Lalovic, Marko
Publicado: (2024)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
por: Bonnet, Édouard, et al.
Publicado: (2026)

Optimized Degree Realization: Minimum Dominating Set & Maximum Matching
por: Bar-Noy, Amotz, et al.
Publicado: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
por: Cook, William, et al.
Publicado: (2026)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
por: Morse, Gregory, et al.
Publicado: (2026)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
por: Patzner, Julian, et al.
Publicado: (2024)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
por: Komusiewicz, Christian, et al.
Publicado: (2023)

A Constant-factor Approximation for Weighted Bond Cover
por: Kim, Eun Jung, et al.
Publicado: (2021)

Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It
por: Bressan, Marco, et al.
Publicado: (2026)

A Tight Meta-theorem for LOCAL Certification of MSO$_2$ Properties within Bounded Treewidth Graphs
por: Cook, Linda, et al.
Publicado: (2025)

Amnesiac Flooding: Easy to break, hard to escape
por: Austin, Henry, et al.
Publicado: (2025)