Cover Image

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Manoharan, Vignesh, Ramachandran, Vijaya
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
by: Manoharan, Vignesh, et al.
Published: (2022)

Deterministic Even-Cycle Detection in Broadcast CONGEST
by: Fraigniaud, Pierre, et al.
Published: (2024)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
by: Faour, Salwa, et al.
Published: (2025)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
by: Chang, Yi-Jun, et al.
Published: (2022)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
by: Gil, Yuval
Published: (2024)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
by: Bonamy, Marthe, et al.
Published: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
by: Mordacchini, Matteo, et al.
Published: (2025)

Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks
by: Gall, François Le, et al.
Published: (2018)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
by: Assadi, Sepehr
Published: (2023)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)

On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)

Weighted Matching in a Poly-Streaming Model
by: Ullah, Ahammed, et al.
Published: (2025)

Memory Bounds for Concurrent Bounded Queues
by: Aksenov, Vitaly, et al.
Published: (2021)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026)

Faster Cycle Detection in the Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2024)

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
by: Robinson, Peter, et al.
Published: (2025)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
by: Chang, Yi-Jun, et al.
Published: (2023)

Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
by: Chang, Yen-Hsiang, et al.
Published: (2025)

Bounded Memory in Distributed Networks
by: Basat, Ran Ben, et al.
Published: (2025)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
by: Akker, Erik van den, et al.
Published: (2024)

Local Density and its Distributed Approximation
by: Christiansen, Aleksander Bjørn, et al.
Published: (2024)

Massively Parallel Algorithms for Approximate Shortest Paths
by: Dory, Michal, et al.
Published: (2024)

Low-Distortion Clustering in Bounded Growth Graphs
by: Chang, Yi-Jun, et al.
Published: (2024)

A Scalable and Unified Framework to Weighted Rank Aggregation
by: Carmel, Amir, et al.
Published: (2026)

Distributed Reductions for the Maximum Weight Independent Set Problem
by: Borowitz, Jannick, et al.
Published: (2025)

Tight Bounds on the Message Complexity of Distributed Tree Verification
by: Kutten, Shay, et al.
Published: (2024)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
by: Cambus, Mélanie, et al.
Published: (2022)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
by: Boneh, Itai, et al.
Published: (2025)

Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
by: Lenzen, Christoph, et al.
Published: (2024)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
by: Ashvinkumar, Vikrant, et al.
Published: (2023)

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
by: Elkin, Michael, et al.
Published: (2025)

GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
by: Kreis, Lara, et al.
Published: (2026)

Improved Byzantine Agreement under an Adaptive Adversary
by: Dufoulon, Fabien, et al.
Published: (2025)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
by: Liu, Quanquan C., et al.
Published: (2024)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
by: Ghaffari, Mohsen, et al.
Published: (2024)

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
by: Chang, Yi-Jun, et al.
Published: (2024)

String Problems in the Congested Clique Model
by: Golan, Shay, et al.
Published: (2025)

$k$-Center Clustering in Distributed Models
by: Biabani, Leyla, et al.
Published: (2024)

A Parallel Scan Algorithm in the Tensor Core Unit Model
by: Zouzias, Anastasios, et al.
Published: (2024)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
by: Chang, Yi-Jun, et al.
Published: (2023)