加权最小顶点覆盖问题的一种快速收敛的分散式方法
A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
AI总结:
针对分散式网络中的NP难最小加权顶点覆盖(MWVC)问题,提出一种仅依赖本地知识的完全分散式协议,实验证明其在降低通信开销的同时保持了解质量。
摘要:
我们解决了在分散式网络中计算最小加权顶点覆盖(MWVC)的问题。MWVC是一个经典的NP难问题,在网络监控和资源放置等应用中具有基础性作用。我们提出了一种完全分散式的协议,其中每个节点仅使用本地知识做出决策,并与邻居进行通信。该方法具有自适应性、通信高效性,并避免了集中式协调。我们在真实和合成图上评估了该协议,并将其与集中式和分散式基线进行比较。结果表明,该协议在减少通信开销的同时,保持了具有竞争力的解质量,突显了在分散式环境中计算MWVC的可行性。
英文摘要:
We address the problem of computing a Minimum Weighted Vertex Cover (MWVC) in a decentralized network. MWVC, a classical NP-hard problem, is foundational in applications such as network monitoring and resource placement. We propose a fully decentralized protocol where each node makes decisions using only local knowledge and communicates with its neighbors. The method is adaptive, communication-efficient, and avoids centralized coordination. We evaluate the protocol on real-world and synthetic graphs, comparing it to both centralized and decentralized baselines. Our results demonstrate competitive solution quality with reduced communication overhead, highlighting the feasibility of MWVC computation in decentralized environments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。