Show simple item record

dc.contributor.authorBÖCKENHAUER, Hans-Joachim
dc.contributor.authorBONGARTZ, Dirk
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.authorPROIETTI, Guido
dc.contributor.authorSEIBERT, Sebastian
dc.contributor.authorUNGER, Walter
dc.date.accessioned2024-04-15T09:55:04Z
dc.date.available2024-04-15T09:55:04Z
dc.date.issued2004-10
dc.identifier.issn1879-2294
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198728
dc.language.isoen
dc.publisherElsevier
dc.title.enOn the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
dc.typeArticle de revue
dc.subject.halInformatique [cs]/Autre [cs.OH]
bordeaux.journalTheoretical Computer Science
bordeaux.page137--153
bordeaux.volume326
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.issue1--3
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-00307017
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00307017v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Theoretical%20Computer%20Science&rft.date=2004-10&rft.volume=326&rft.issue=1--3&rft.spage=137--153&rft.epage=137--153&rft.eissn=1879-2294&rft.issn=1879-2294&rft.au=B%C3%96CKENHAUER,%20Hans-Joachim&BONGARTZ,%20Dirk&HROMKOVIC,%20Juraj&KLASING,%20Ralf&PROIETTI,%20Guido&rft.genre=article


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record