HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

Inapproximability proof of DSTLB and USTLB in planar graphs

Dimitri Watel 1, * Marc-Antoine Weisser 1, * Cédric Bentz 2
* Corresponding author
2 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
Document type :
Reports
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download

https://hal-supelec.archives-ouvertes.fr/hal-00793424
Contributor : Marc-Antoine Weisser Connect in order to contact the contributor
Submitted on : Monday, February 25, 2013 - 11:24:00 AM
Last modification on : Monday, February 21, 2022 - 3:38:19 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

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⟩

Share

Metrics

Record views

139

Files downloads

71