Image de couverture de livre

Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Georgiou, Konstantinos, Jones, Caleb, Madej, Matthew
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
par: Komusiewicz, Christian, et autres
Publié: (2026)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
par: Harada, Tsubasa
Publié: (2024)

Edge Clique Partition and Cover Beyond Independence
par: Fomin, Fedor V., et autres
Publié: (2025)

Optimal Generation of Strictly Increasing Binary Trees and Beyond
par: Bodini, Olivier, et autres
Publié: (2024)

FO and MSO Model Checking on Temporal Graphs
par: Döring, Michelle, et autres
Publié: (2026)

Isomorphism Testing Parameterized by Genus and Beyond
par: Neuen, Daniel
Publié: (2021)

Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
par: Antoniadis, Antonios, et autres
Publié: (2025)

New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets
par: Prasad, Siddharth, et autres
Publié: (2024)

Parameterised algorithms for temporally satisfying reconfiguration problems
par: Davot, Tom, et autres
Publié: (2025)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
par: Holtgrefe, Niels, et autres
Publié: (2024)

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
par: Jenssen, Matthew, et autres
Publié: (2023)

String Matching with a Dynamic Pattern
par: Monteiro, Bruno, et autres
Publié: (2025)

Inverse matroid optimization under subset constraints
par: Bérczi, Kristóf, et autres
Publié: (2025)

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
par: Jordon, Addie, et autres
Publié: (2025)

Graph Coloring Below Guarantees via Co-Triangle Packing
par: Akmal, Shyan, et autres
Publié: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
par: Mizutani, Ryuhei
Publié: (2025)

Greedy Algorithms for Shortcut Sets and Hopsets
par: Bals, Ben, et autres
Publié: (2025)

Approximating Submodular Matroid-Constrained Partitioning
par: Bérczi, Kristóf, et autres
Publié: (2025)

Space-Efficient Hierholzer: Eulerian Cycles in $\mathrm{O}(m)$ Time and $\mathrm{O}(n)$ Space
par: Alaoui, Ziad Ismaili, et autres
Publié: (2025)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
par: Veldt, Nate
Publié: (2025)

(Approximate) Matrix Multiplication via Convolutions
par: Uffenheimer, Yahel, et autres
Publié: (2025)

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
par: Arhire, Andrei, et autres
Publié: (2025)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
par: Foucaud, Florent, et autres
Publié: (2025)

Circle graphs can be recognized in linear time
par: Paul, Christophe, et autres
Publié: (2025)

Source-Oblivious Broadcast
par: Fraigniaud, Pierre, et autres
Publié: (2025)

A Parameterized Perspective on Uniquely Restricted Matchings
par: Chaudhary, Juhi, et autres
Publié: (2025)

When does FTP become FPT?
par: Bentert, Matthias, et autres
Publié: (2025)

Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
par: Gaikwad, Ajinkya
Publié: (2025)

Testing Quasiperiodicity
par: Awofeso, Christine, et autres
Publié: (2025)

Functional design of efficient and parallelizable combinatorial generators using convolution
par: He, Xi, et autres
Publié: (2025)

Unsplittable Cost Flows from Unweighted Error-Bounded Variants
par: Swamy, Chaitanya, et autres
Publié: (2025)

H-Planarity and Parametric Extensions: when Modulators Act Globally
par: Fomin, Fedor V., et autres
Publié: (2025)

An Exact Solver for Submodular Knapsack Problems
par: Münch, Sabine, et autres
Publié: (2025)

Beware of the Classical Benchmark Instances for the Traveling Salesman Problem with Time Windows
par: Soulignac, Francisco J.
Publié: (2025)

Fast approximation algorithms for the 1-median problem on real-world large graphs
par: Ueta, Keisuke, et autres
Publié: (2025)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
par: Gahlawat, Harmender, et autres
Publié: (2025)

Path Contraction Faster than $2^n$
par: Agrawal, Akanksha, et autres
Publié: (2025)

Treewidth Parameterized by Feedback Vertex Number
par: Molter, Hendrik, et autres
Publié: (2025)

Nyldon Factorization of Thue-Morse Words and Fibonacci Words
par: Kishi, Kaisei, et autres
Publié: (2025)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
par: Liu, Bowie, et autres
Publié: (2025)