Minimum Congestion Redundant Assignments to Tolerate Random Faults

Fotakis, D; Spirakis, P

dc.contributor.author	Fotakis, D	en
dc.contributor.author	Spirakis, P	en
dc.date.accessioned	2014-03-01T01:51:40Z
dc.date.available	2014-03-01T01:51:40Z
dc.date.issued	2002	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/26377
dc.subject	Approximate Algorithm	en
dc.subject	Fault Tolerant	en
dc.subject	Polynomial Time	en
dc.title	Minimum Congestion Redundant Assignments to Tolerate Random Faults	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s00453-001-0080-0	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s00453-001-0080-0	en
heal.publicationDate	2002	en
heal.abstract	Abstract. We consider the problem of computing minimum congestion, fault-tolerant, redundant assignments of messages to faulty, parallel delivery channels. In particular, we are given a set K of faulty channels, each having an integer capacity c i and failing independently with probability f i . We are also given a set M of messages to be delivered over K	en
heal.journalName	Algorithmica	en
dc.identifier.doi	10.1007/s00453-001-0080-0	en