Mostrar el registro sencillo del ítem

Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem

dc.contributor.authorBÖCKENHAUER, Hans-Joachim
dc.contributor.authorHROMKOVIC, Juraj
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
dc.contributor.authorKLASING, Ralf
dc.contributor.authorSEIBERT, Sebastian
dc.contributor.authorUNGER, Walter
dc.date.accessioned2024-04-15T09:55:05Z
dc.date.available2024-04-15T09:55:05Z
dc.date.issued2002-08
dc.identifier.issn1879-2294
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198729
dc.language.isoen
dc.publisherElsevier
dc.title.enTowards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
dc.typeArticle de revue
dc.subject.halInformatique [cs]/Autre [cs.OH]
bordeaux.journalTheoretical Computer Science
bordeaux.page3--24
bordeaux.volume285
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.issue1
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-00307016
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00307016v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Theoretical%20Computer%20Science&rft.date=2002-08&rft.volume=285&rft.issue=1&rft.spage=3--24&rft.epage=3--24&rft.eissn=1879-2294&rft.issn=1879-2294&rft.au=B%C3%96CKENHAUER,%20Hans-Joachim&HROMKOVIC,%20Juraj&KLASING,%20Ralf&SEIBERT,%20Sebastian&UNGER,%20Walter&rft.genre=article


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem