Image de couverture de livre

Search and evacuation with a near majority of faulty agents

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Czyzowicz, J., Killick, R., Kranakis, E., Stachowiak, G.
Format:	Preprint
Publié:	2026
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

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

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

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

Efficiency of Self-Adjusting Heaps
par: Sinnamon, Corwin, et autres
Publié: (2023)

Revisiting Path Contraction and Cycle Contraction
par: Krithika, R., et autres
Publié: (2024)

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

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

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

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

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
par: Goswami, Mayank, et autres
Publié: (2022)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
par: Bauernöppel, Frank, 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)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
par: Bergougnoux, Benjamin, et autres
Publié: (2026)

A $2$-branching construction for the $χ\leq 2r$ bound
par: Date, Vinicius Tikara Venturi, et autres
Publié: (2026)

SimdQuickHeap: The QuickHeap Reconsidered
par: Breitling, Johannes, et autres
Publié: (2026)

Approximately Partitioning Vertices into Short Paths
par: Gong, Mingyang, et autres
Publié: (2026)

On the Online Weighted Non-Crossing Matching Problem
par: Boyar, Joan, et autres
Publié: (2026)

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
par: Roditty, Liam, et autres
Publié: (2026)

Forwarding Packets Greedily
par: Boyar, Joan, et autres
Publié: (2026)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
par: Haeupler, Bernhard, et autres
Publié: (2023)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
par: Haeupler, Bernhard, et autres
Publié: (2024)

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)

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

Online $b$-Matching with Stochastic Rewards
par: Albers, Susanne, et autres
Publié: (2024)

On the satisfability of random k-Horn formulae
par: Istrate, Gabriel
Publié: (2000)

Approximation algorithms for Job Scheduling with reconfigurable resources
par: Bergé, Pierre, et autres
Publié: (2023)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
par: Antoniadis, Antonios, et autres
Publié: (2020)

Online Interval Scheduling with Predictions
par: Boyar, Joan, et autres
Publié: (2023)

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

Sorting and Ranking of Self-Delimiting Numbers with Applications to Outerplanar Graph Isomorphism
par: Kammer, Frank, et autres
Publié: (2020)

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