Thumbnail

On the approximability of Minimum labeled spanning trees when each color appears at most r -times

Monnot, Jérôme (2002), On the approximability of Minimum labeled spanning trees when each color appears at most r -times. https://basepub.dauphine.fr/handle/123456789/9730

View/Open
Type
Document de travail / Working paper
Date
2002
Publisher
Université Paris-Dauphine
Series title
Cahier du LAMSADE
Series number
200
Published in
Paris
Pages
10
Metadata
Show full item record
Author(s)
Monnot, Jérôme cc
Subjects / Keywords
APX-completeness; Local optimization; Spanning tree; APX-complétude; Optimisation locale; Approximation; Arbre couvrant