Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmica

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

Jochen Könemann, Asaf Levin, Amitabh Sinha

Journal Title: Algorithmica

Date: 2004

Volume: 41

Issue: 2

p. 117 - 129

For further information about this item go to:

http://dx.doi.org/10.1007/s00453-004-1121-2

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12