A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmica

A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology

Guoliang Xue, Wei Xiao

Journal Title: Algorithmica

Date: 2004

Volume: 41

Issue: 1

p. 53 - 72

For further information about this item go to:

http://dx.doi.org/10.1007/s00453-004-1119-9

This data comes from DBLP

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