Abstract
In minimum power network design problems we are given an undirected graph G=(V,E) with edge costs {ce:e∈E}. The goal is to find an edge set F⊆E that satisfies a prescribed property of minimum power pc(F)=∑v∈Vmax{ce:e∈F is incident to v}. In the Min-PowerkEdge Disjointst-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 22k-approximation algorithm for general costs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
