{"title":"网络可靠性问题的一种新的边界处理方法","authors":"C. Suffel","doi":"10.1109/ICC.1988.13651","DOIUrl":null,"url":null,"abstract":"A description is given of a way to obtain bounds which will be tight over the class of networks for all possible values of the edge failure rate. These bounds have been shown to be valid for a certain range of edge failure rates. The author discusses the known bounding methods before proposing the new approach.<<ETX>>","PeriodicalId":191242,"journal":{"name":"IEEE International Conference on Communications, - Spanning the Universe.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new bounding procedure for the network reliability problem\",\"authors\":\"C. Suffel\",\"doi\":\"10.1109/ICC.1988.13651\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A description is given of a way to obtain bounds which will be tight over the class of networks for all possible values of the edge failure rate. These bounds have been shown to be valid for a certain range of edge failure rates. The author discusses the known bounding methods before proposing the new approach.<<ETX>>\",\"PeriodicalId\":191242,\"journal\":{\"name\":\"IEEE International Conference on Communications, - Spanning the Universe.\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Communications, - Spanning the Universe.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1988.13651\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Communications, - Spanning the Universe.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1988.13651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new bounding procedure for the network reliability problem
A description is given of a way to obtain bounds which will be tight over the class of networks for all possible values of the edge failure rate. These bounds have been shown to be valid for a certain range of edge failure rates. The author discusses the known bounding methods before proposing the new approach.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
