Inapproximability proof of DSTLB and USTLB in planar graphs - CentraleSupélec Access content directly
Reports Year : 2013

Inapproximability proof of DSTLB and USTLB in planar graphs

Abstract

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.
Fichier principal
Vignette du fichier
planarcasinapprox.pdf (215.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00793424 , version 1 (22-02-2013)
hal-00793424 , version 2 (25-02-2013)

Identifiers

  • HAL Id : hal-00793424 , version 1

Cite

Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz. Inapproximability proof of DSTLB and USTLB in planar graphs. 2013. ⟨hal-00793424v1⟩
173 View
154 Download

Share

Gmail Facebook X LinkedIn More