Catálogo de publicaciones - libros
Graph-Theoretic Concepts in Computer Science: 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers
Andreas Brandstädt ; Dieter Kratsch ; Haiko Müller (eds.)
En conferencia: 33º International Workshop on Graph-Theoretic Concepts in Computer Science (WG) . Dornburg, Germany . June 21, 2007 - June 23, 2007
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
Theory of Computation; Simulation and Modeling; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Numeric Computing; Data Structures
Disponibilidad
| Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
|---|---|---|---|---|
| No detectada | 2007 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-3-540-74838-0
ISBN electrónico
978-3-540-74839-7
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2007
Información sobre derechos de publicación
© Springer-Verlag Berlin Heidelberg 2007
Cobertura temática
Tabla de contenidos
The Complexity of Bottleneck Labeled Graph Problems
Refael Hassin; Jérôme Monnot; Danny Segev
We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long-established model partitions the set of edges into classes, each of which is identified by a unique color. The generic objective is to construct a subgraph of prescribed structure (such as that of being an s - t path, a spanning tree, or a perfect matching) while trying to avoid over-picking or under-picking edges from any given color.
Palabras clave: Span Tree; Perfect Match; Multiobjective Optimization Problem; Matroid Intersection; Bisection Width.
Pp. 328-340