Copertina

Amnesiac Flooding: Easy to break, hard to escape

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Austin, Henry, Gadouleau, Maximilien, Mertzios, George B., Trehan, Amitabh
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Distributed, Parallel, and Cluster Computing Discrete Mathematics Data Structures and Algorithms 68W15, 68W40, 05C85, 68Q25 F.2.0; G.2.2; C.2.2; C.2.4
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs
di: Casteigts, Arnaud, et al.
Pubblicazione: (2023)

Simple, strict, proper, happy: A study of reachability in temporal graphs
di: Casteigts, Arnaud, et al.
Pubblicazione: (2022)

Two-Robot Computational Landscape: A Complete Characterization of Model Power in Minimal Mobile Robot Systems
di: Kitamura, Naoki, et al.
Pubblicazione: (2025)

Data Scheduling Algorithm for Scalable and Efficient IoT Sensing in Cloud Computing
di: Mohammad, Noor Islam S.
Pubblicazione: (2025)

Replication in Graph Partitioning and Scheduling Problems
di: Papp, Pál András, et al.
Pubblicazione: (2026)

An Improved Drift Theorem for Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2023)

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

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

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

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

Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs
di: Ju, Caleb, et al.
Pubblicazione: (2023)

SmartEdge: Smart Healthcare End-to-End Integrated Edge and Cloud Computing System for Diabetes Prediction Enabled by Ensemble Machine Learning
di: Hennebelle, Alain, et al.
Pubblicazione: (2025)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
di: Krishnaswamy, Ravishankar, et al.
Pubblicazione: (2014)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
di: Hommelsheim, Felix
Pubblicazione: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
di: Bosch-Calvo, Miguel, et al.
Pubblicazione: (2023)

Exact Algorithms for MaxCut on Split Graphs
di: Lalovic, Marko
Pubblicazione: (2024)

CRDT-Based Game State Synchronization in Peer-to-Peer VR
di: Dantas, Abel, et al.
Pubblicazione: (2025)

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

A $5/4$-Approximation for Two-Edge Connectivity
di: Bosch-Calvo, Miguel, et al.
Pubblicazione: (2024)

Safe Low Bandwidth SPV: A Formal Treatment of Simplified Payment Verification Protocols and Security Bounds
di: Wright, Craig S
Pubblicazione: (2025)

The Power of Filling in Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2022)

Mean-Biased Processes for Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2023)

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

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
di: Haslebacher, Sebastian
Pubblicazione: (2025)

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

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

Traffic-Oblivious Multi-Commodity Flow Network Design
di: Chimani, Markus, et al.
Pubblicazione: (2025)

Shortest two disjoint paths in conservative graphs
di: Schlotter, Ildikó
Pubblicazione: (2023)

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

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

On the Average-Case Performance of Greedy for Maximum Coverage
di: Balkanski, Eric, et al.
Pubblicazione: (2026)

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

W-state graphs: Structure and Algorithms
di: Gajjala, Rishikesh, et al.
Pubblicazione: (2026)

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

Local iterative algorithms for approximate symmetry guided by network centralities
di: Hartman, David, et al.
Pubblicazione: (2025)

An asymptotically optimal algorithm for generating bin cardinalities
di: Devroye, Luc, et al.
Pubblicazione: (2024)

Searching by Heterogeneous Agents
di: Dereniowski, Dariusz, et al.
Pubblicazione: (2021)

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
di: Fang, Xiaolei, et al.
Pubblicazione: (2026)

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

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