最小功率 k 边相邻 st 路径的 22k 近似算法

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing Letters Pub Date : 2024-08-14 DOI:10.1016/j.ipl.2024.106532

Zeev Nutov

引用次数: 0

摘要

在最小功率网络设计问题中，我们给定了一个无向图 G=(V,E)，其边成本为 {ce:e∈E}。目标是找到满足最小功率 pc(F)=∑v∈Vmax{ce:e∈F is incident to v} 的规定属性的边集 F⊆E。在最小功率 k 边相邻 st 路径问题中，F 应包含 k 边相邻 st 路径。对于简单图，甚至对于单位成本，如何实现近似率亚线性于 k 是一个悬而未决的问题。我们给出了针对一般成本的 22k 近似算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A 22k-approximation algorithm for minimum power k edge disjoint st-paths

In minimum power network design problems we are given an undirected graph $G = (V, E)$ with edge costs ${c_{e} : e \in E}$ . The goal is to find an edge set $F \subseteq E$ that satisfies a prescribed property of minimum power $p_{c} (F) = \sum_{v \in V} \max {c_{e} : e \in F is incident to v}$ . In the Min-Power k Edge Disjoint st-Paths problem F should contain k edge disjoint st-paths. The problem admits a k-approximation algorithm, and it was an open question to achieve an approximation ratio sublinear in k for simple graphs, even for unit costs. We give a $2 \sqrt{2 k}$ -approximation algorithm for general costs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.

期刊最新文献

On the Tractability Landscape of the Conditional Minisum Approval Voting Rule Total variation distance for product distributions is #P-complete A lower bound for the Quickhull convex hull algorithm that disproves the Quickhull precision conjecture String searching with mismatches using AVX2 and AVX-512 instructions On approximate reconfigurability of label cover