Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost

DOI10.1007/978-3-642-38233-8_1zbMath1382.68328OpenAlexW64257473MaRDI QIDQ4924633

Hasna Mohsen Alqahtani, Erlebach, Thomas

Publication date: 7 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38233-8_1

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (2)

Minimum shared‐power edge cut ⋮ An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths

This page was built for publication: Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost