Imagen de Portada

The Complexity of Distributed Minimum Weight Cycle Approximation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chang, Yi-Jun, Chen, Yanyu, Dey, Dipan, Jiang, Yonggang, Mishra, Gopinath, Nguyen, Hung Thuan, Yang, Mingyang
Formato:	Preprint
Publicado:	2026
Materias:	Distributed, Parallel, and Cluster Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Optimal Distributed Replacement Paths
por: Chang, Yi-Jun, et al.
Publicado: (2025)

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

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

Round and Communication Efficient Graph Coloring
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
por: Manoharan, Vignesh, et al.
Publicado: (2023)

Distributed and Autonomic Minimum Spanning Trees
por: Rodrigues, Luiz A., et al.
Publicado: (2025)

Performance of Distributed File Systems on Cloud Computing Environment: An Evaluation for Small-File Problem
por: Duong, Thanh, et al.
Publicado: (2023)

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

Approximated Coded Computing: Towards Fast, Private and Secure Distributed Machine Learning
por: Qiu, Houming, et al.
Publicado: (2024)

Distributed Seasonal Temporal Pattern Mining
por: Ho-Long, Van, et al.
Publicado: (2025)

Adaptive, Efficient and Fair Resource Allocation in Cloud Datacenters leveraging Weighted A3C Deep Reinforcement Learning
por: Kumari, Suchi, et al.
Publicado: (2025)

Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election
por: Chang, Yi-Jun, et al.
Publicado: (2025)

GRNND: A GPU-Parallel Relative NN-Descent Algorithm for Efficient Approximate Nearest Neighbor Graph Construction
por: Li, Xiang, et al.
Publicado: (2025)

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

Approximate Byzantine Fault-Tolerance in Distributed Optimization
por: Liu, Shuo, et al.
Publicado: (2021)

Barycentric Coded Distributed Computing with Flexible Recovery Threshold for Collaborative Mobile Edge Computing
por: Qiu, Houming, et al.
Publicado: (2025)

A Distributed Edge FLISR Solution & Network Simulation Test Platform
por: Leniston, Darren, et al.
Publicado: (2024)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
por: Chang, Yi-Jun
Publicado: (2023)

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

Performance Trade-offs of High Order Meshless Approximation on Distributed Memory Systems
por: Vehovar, Jon, et al.
Publicado: (2025)

Distributed Complexity of $P_k$-freeness: Decision and Certification
por: Miyamoto, Masayuki
Publicado: (2024)

Deterministic Distributed Algorithms and Measurable Combinatorics on $Δ$-Regular Forests
por: Brandt, Sebastian, et al.
Publicado: (2022)

Efficient Training of Large Language Models on Distributed Infrastructures: A Survey
por: Duan, Jiangfei, et al.
Publicado: (2024)

Distributed system perspective on Backscatter systems
por: Guan, Jincheng, et al.
Publicado: (2025)

Content-Oblivious Leader Election in 2-Edge-Connected Networks
por: Chalopin, Jérémie, et al.
Publicado: (2025)

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
por: Chalopin, Jérémie, et al.
Publicado: (2025)

FDO Manager: Minimum Viable FAIR Digital Object Implementation
por: Zoubia, Oussama, et al.
Publicado: (2024)

ACE-Sync: An Adaptive Cloud-Edge Synchronization Framework for Communication-Efficient Large-Scale Distributed Model Training
por: Yang, Yi, et al.
Publicado: (2025)

MoLink: Distributed and Efficient Serving Framework for Large Models
por: Jin, Lewei, et al.
Publicado: (2025)

SPPO:Efficient Long-sequence LLM Training via Adaptive Sequence Pipeline Parallel Offloading
por: Chen, Qiaoling, et al.
Publicado: (2025)

Communication-Efficient Serving for Video Diffusion Models with Latent Parallelism
por: Wu, Zhiyuan, et al.
Publicado: (2025)

OnePiece: A Large-Scale Distributed Inference System with RDMA for Complex AI-Generated Content (AIGC) Workflows
por: Chen, June, et al.
Publicado: (2026)

Centroid Approximation with Multidimensional Approximate Agreement Protocols
por: Cambus, Melanie, et al.
Publicado: (2023)

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss
por: Luo, Jingjia, et al.
Publicado: (2025)

Efficient Counting and Simulation in Content-Oblivious Rings
por: Chalopin, Jérémie, et al.
Publicado: (2026)

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

PromptTuner: SLO-Aware Elastic System for LLM Prompt Tuning
por: Gao, Wei, et al.
Publicado: (2026)

KV Cache Compression for Inference Efficiency in LLMs: A Review
por: Liu, Yanyu, et al.
Publicado: (2025)

Adaptive Weighting Push-SUM for Decentralized Optimization with Statistical Diversity
por: Zhou, Yiming, et al.
Publicado: (2024)

OD-MoE: On-Demand Expert Loading for Cacheless Edge-Distributed MoE Inference
por: Wang, Liujianfu, et al.
Publicado: (2025)