Approximating Fault-Tolerant Group-Steiner problems
From MaRDI portal
Publication:2920133
DOI10.4230/LIPICS.FSTTCS.2009.2324zbMath1248.68383OpenAlexW2279143674MaRDI QIDQ2920133
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
Publication date: 24 October 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_e9bf.html
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
The relation of connected set cover and group Steiner tree ⋮ Approximation algorithms for minimum weight partial connected set cover problem
This page was built for publication: Approximating Fault-Tolerant Group-Steiner problems
