Inapproximability proof of DSTLB and USTLB in planar graphs

Dimitri Watel 1, * Marc-Antoine Weisser 1, * Cédric Bentz 2
* Corresponding author
1 E3S - Supélec Sciences des Systèmes [Gif-sur-Yvette]
2 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
Document type :
Reports
Complete list of metadatas

Cited literature [2 references]  Display  Hide  Download
https://hal-supelec.archives-ouvertes.fr/hal-00793424
Contributor : Marc-Antoine Weisser <>
Submitted on : Monday, February 25, 2013 - 11:24:00 AM
Last modification on : Friday, January 24, 2020 - 12:04:01 PM
Long-term archiving on: Sunday, April 2, 2017 - 4:55:28 AM

File

planarcasinapprox.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00793424, version 2

Collections

SUPELEC | SUP_E3S | CNAM | LARA | UNIV-HESAM | SUP_INFO | CEDRIC-CNAM

Citation

Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz. Inapproximability proof of DSTLB and USTLB in planar graphs. [Research Report] Supélec. 2013. ⟨hal-00793424v2⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

259

Files downloads

108

Contact

Informations

CCSD