Thumbnail
Métadonnées
Afficher la notice complète
Licence d’utilisation du document

Improved Approximations for TSP with Simple Precedence Constraints

BÖCKENHAUER, Hans-Joachim
Department of Computer Science [ETH Zürich] [D-INFK]
KLASING, Ralf
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
MÖMKE, Tobias
Department of Computer Science [ETH Zürich] [D-INFK]
Voir plus >
Langue
en
Communication dans un congrès
Ce document a été publié dans
Proceedings of the 7th International Conference on Algorithms and Complexity, Proceedings of the 7th International Conference on Algorithms and Complexity, CIAC 2010, 2010-05. 2010, vol. 6078, p. 61--72
URI
https://oskar-bordeaux.fr/handle/20.500.12278/198274
DOI
Project ANR
Algorithm Design and Analysis for Implicitly and Incompletely Defined Interaction Networks - ANR-07-BLAN-0322
Origine
Importé de hal
Unités de recherche