找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Connected Dominating Set: Theory and Applications; Ding-Zhu Du,Peng-Jun Wan Textbook 2013 Springer Science+Business Media New York 2013 ap

[复制链接]
查看: 26930|回复: 47
发表于 2025-3-21 17:18:43 | 显示全部楼层 |阅读模式
书目名称Connected Dominating Set: Theory and Applications
编辑Ding-Zhu Du,Peng-Jun Wan
视频videohttp://file.papertrans.cn/236/235574/235574.mp4
概述This unique book may be used as a reference and/or supplementary text in a graduate seminar.The expository content and complete list of references in each chapter bring the reader quickly to the foref
丛书名称Springer Optimization and Its Applications
图书封面Titlebook: Connected Dominating Set: Theory and Applications;  Ding-Zhu Du,Peng-Jun Wan Textbook 2013 Springer Science+Business Media New York 2013 ap
描述The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to have important applications in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, we are going to collect recent developments on the connected dominating set, which presents the state of the art in the study of connected dominating sets. The book consists of 16 chapters. Except the 1st one, each chapter is devoted to one problem, and consists of three parts, motivation and overview, problem complexity analysis, and approximation algorithm designs, which will lead the reader to see clearly about the background, formulation, existing important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete math
出版日期Textbook 2013
关键词approximation algorithms; complexity analysis; connected dominating set; network optimization; wireless
版次1
doihttps://doi.org/10.1007/978-1-4614-5242-3
isbn_softcover978-1-4899-8714-3
isbn_ebook978-1-4614-5242-3Series ISSN 1931-6828 Series E-ISSN 1931-6836
issn_series 1931-6828
copyrightSpringer Science+Business Media New York 2013
The information of publication is updating

书目名称Connected Dominating Set: Theory and Applications影响因子(影响力)




书目名称Connected Dominating Set: Theory and Applications影响因子(影响力)学科排名




书目名称Connected Dominating Set: Theory and Applications网络公开度




书目名称Connected Dominating Set: Theory and Applications网络公开度学科排名




书目名称Connected Dominating Set: Theory and Applications被引频次




书目名称Connected Dominating Set: Theory and Applications被引频次学科排名




书目名称Connected Dominating Set: Theory and Applications年度引用




书目名称Connected Dominating Set: Theory and Applications年度引用学科排名




书目名称Connected Dominating Set: Theory and Applications读者反馈




书目名称Connected Dominating Set: Theory and Applications读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-22 00:15:58 | 显示全部楼层
Textbook 2013ting important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete math
发表于 2025-3-22 01:56:14 | 显示全部楼层
发表于 2025-3-22 07:19:09 | 显示全部楼层
发表于 2025-3-22 10:04:41 | 显示全部楼层
Textbook 2013cations in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, w
发表于 2025-3-22 14:24:09 | 显示全部楼层
Maurice Rumboll,Pablo Alejandro Lépez Pérez multihop wireless networks with disparate communication ranges [102, 124]. Indeed, if . represents the set of nodes in a multihop wireless network and each .. represents the communication radius of the node ., the DCG of . is exactly the symmetric communication topology of the multihop wireless network.
发表于 2025-3-22 19:11:24 | 显示全部楼层
Only few graphs have bounded treewidth,algorithm. Thus, it is immediate to conclude that . in planar graphs can be approximated within a factor 3+ε for any ε>0 in polynomial time. However, the degree of the polynomial grows with 1∕ε and hence, the approximation scheme is hardly practical.
发表于 2025-3-22 21:59:26 | 显示全部楼层
发表于 2025-3-23 01:33:27 | 显示全部楼层
发表于 2025-3-23 07:30:04 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-14 13:20
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表