On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
dc.contributor.author | BÖCKENHAUER, Hans-Joachim | |
dc.contributor.author | BONGARTZ, Dirk | |
dc.contributor.author | HROMKOVIC, Juraj | |
hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
dc.contributor.author | KLASING, Ralf | |
dc.contributor.author | PROIETTI, Guido | |
dc.contributor.author | SEIBERT, Sebastian | |
dc.contributor.author | UNGER, Walter | |
dc.date.accessioned | 2024-04-15T09:55:06Z | |
dc.date.available | 2024-04-15T09:55:06Z | |
dc.date.issued | 2002 | |
dc.date.conference | 2002 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198731 | |
dc.language.iso | en | |
dc.source.title | On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality | |
dc.title.en | On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality | |
dc.type | Communication dans un congrès | |
dc.subject.hal | Informatique [cs]/Autre [cs.OH] | |
bordeaux.page | 59--70 | |
bordeaux.volume | 2556 | |
bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
bordeaux.conference.title | Proc. of the 22nd Conference on Foundations of Software Technology and Theoretial Computer Science (FSTTCS 2002) | |
bordeaux.country | IN | |
bordeaux.title.proceeding | On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality | |
bordeaux.peerReviewed | oui | |
hal.identifier | hal-00307015 | |
hal.version | 1 | |
hal.invited | non | |
hal.proceedings | oui | |
hal.popular | non | |
hal.audience | Internationale | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-00307015v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=On%20the%20hardness%20of%20constructing%20minimal%202-connected%20spanning%20subgraphs%20in%20complete%20graphs%20with%20sharpened%20triangle%20inequality&rft.date=2002&rft.volume=2556&rft.spage=59--70&rft.epage=59--70&rft.au=B%C3%96CKENHAUER,%20Hans-Joachim&BONGARTZ,%20Dirk&HROMKOVIC,%20Juraj&KLASING,%20Ralf&PROIETTI,%20Guido&rft.genre=unknown |
Fichier(s) constituant ce document
Fichiers | Taille | Format | Vue |
---|---|---|---|
Il n'y a pas de fichiers associés à ce document. |