Deterministic risk control for cost-effective network connections

dc.creatorAlvarez-Miranda, E.
dc.creatorChen, X.J.
dc.creatorHu, J.
dc.creatorHu, X.D.
dc.creatorCandia-Vejar, A.
dc.date2012-09-28T19:47:32Z
dc.date2012-09-28T19:47:32Z
dc.date2011-01
dc.date.accessioned2017-03-07T14:58:37Z
dc.date.available2017-03-07T14:58:37Z
dc.identifierTHEORETICAL COMPUTER SCIENCE Volume: 412 Issue: 3 Special Issue: SI Pages: 257-264 DOI: 10.1016/j.tcs.2009.08.019
dc.identifier0304-3975
dc.identifierhttp://dspace.utalca.cl/handle/1950/8920
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/375855
dc.descriptionAlvarez-Miranda, E (Alvarez-Miranda, Eduardo);Candia-Vejar, A (Candia-Vejar, Alfredo).Univ Talca, Ind Management Dept, Talca, Chile
dc.descriptionThis paper considers the minimum connection problem in networks with uncertain data. In such a network it is assumed that one can establish a link e by paying a cost c(e) in a given interval [c(e)(-), c(e)(+)] while taking a risk (c(e)(+) - c(e))/(c(e)(+) - c(e)(-)) of link failure. We develop polynomial time algorithms for minimum cost network connection with paths or spanning trees under risk-sum constraints. (C) 2009 Elsevier B.V. All rights reserved.
dc.languageen
dc.publisherELSEVIER SCIENCE BV
dc.subjectPolynomial time algorithms
dc.subjectInterval data
dc.subjectNetwork design
dc.titleDeterministic risk control for cost-effective network connections
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución