Inapproximability proof of DSTLB and USTLB in planar graphs
Résumé
This document proves the problem of finding a minimum cost Steiner Tree covering k terminals with at most p branching nodes (with outdegree greater than 1), in a directed or an undirected planar graph with n nodes, is hard to approximate within a better ratio than n, even when the parameter p is fixed.
Domaines
Complexité [cs.CC]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|