发布求助
文献互助 智能选刊 最新文献

2006 Symposium on Communications and Vehicular Technology最新文献

筛选
英文 中文
Robustness of networks against viruses: the role of the spectral radius 网络对病毒的鲁棒性:谱半径的作用
2006 Symposium on Communications and Vehicular Technology Pub Date : 1900-01-01 DOI: 10.1109/SCVT.2006.334367
A. Jamakovic, R. Kooij, P. Mieghem, E. V. Dam
{"title":"Robustness of networks against viruses: the role of the spectral radius","authors":"A. Jamakovic, R. Kooij, P. Mieghem, E. V. Dam","doi":"10.1109/SCVT.2006.334367","DOIUrl":"https://doi.org/10.1109/SCVT.2006.334367","url":null,"abstract":"In this paper we study the spectral radius of a number of real-life networks. This study is motivated by the fact that the smaller the spectral radius, the higher the robustness of a network against the spread of viruses. First we study how well-known upper bounds for the spectral radius of graphs match to the spectral radii of the social network of the Dutch soccer team, the Dutch roadmap network, the network of the observable part of the Internet graph at the IP-level and the autonomous system level. Secondly, we compare the spectral radius for these real-life networks with those of commonly used complex network models","PeriodicalId":233922,"journal":{"name":"2006 Symposium on Communications and Vehicular Technology","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126275035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 46
Rounding in ϵ-approximation algorithms ϵ-approximation算法中的四舍五入
2006 Symposium on Communications and Vehicular Technology Pub Date : 1900-01-01 DOI: 10.1109/SCVT.2006.334379
F. Kuipers
{"title":"Rounding in ϵ-approximation algorithms","authors":"F. Kuipers","doi":"10.1109/SCVT.2006.334379","DOIUrl":"https://doi.org/10.1109/SCVT.2006.334379","url":null,"abstract":"A common approach to deal with NP-hard problems is to deploy polynomial-time ϵ-approximation algorithms. These algorithms often resort to rounding and scaling to guarantee a solution that is within a factor (1 + isin) of the optimal solution. Usually, researchers either only round up or only down. In this paper we will evaluate the gain in accuracy when rounding up and down. The main application of this technique upon which we focus is quality of service routing, and specifically the restricted shortest path problem","PeriodicalId":233922,"journal":{"name":"2006 Symposium on Communications and Vehicular Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124255766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信