找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪(fǎng)問(wèn)微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 26944|回復(fù): 47
樓主
發(fā)表于 2025-3-21 17:18:43 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱(chēng)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
叢書(shū)名稱(chēng)Springer Optimization and Its Applications
圖書(shū)封面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
關(guān)鍵詞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

書(shū)目名稱(chēng)Connected Dominating Set: Theory and Applications影響因子(影響力)




書(shū)目名稱(chēng)Connected Dominating Set: Theory and Applications影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Connected Dominating Set: Theory and Applications網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Connected Dominating Set: Theory and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Connected Dominating Set: Theory and Applications被引頻次




書(shū)目名稱(chēng)Connected Dominating Set: Theory and Applications被引頻次學(xué)科排名




書(shū)目名稱(chēng)Connected Dominating Set: Theory and Applications年度引用




書(shū)目名稱(chēng)Connected Dominating Set: Theory and Applications年度引用學(xué)科排名




書(shū)目名稱(chēng)Connected Dominating Set: Theory and Applications讀者反饋




書(shū)目名稱(chēng)Connected Dominating Set: Theory and Applications讀者反饋學(xué)科排名




單選投票, 共有 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

您所在的用戶(hù)組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 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
板凳
發(fā)表于 2025-3-22 01:56:14 | 只看該作者
地板
發(fā)表于 2025-3-22 07:19:09 | 只看該作者
5#
發(fā)表于 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
6#
發(fā)表于 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.
7#
發(fā)表于 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.
8#
發(fā)表于 2025-3-22 21:59:26 | 只看該作者
9#
發(fā)表于 2025-3-23 01:33:27 | 只看該作者
10#
發(fā)表于 2025-3-23 07:30:04 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 08:03
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
靖州| 永宁县| 普兰县| 汝阳县| 石屏县| 浪卡子县| 攀枝花市| 贵阳市| 萨嘎县| 三亚市| 龙胜| 乡宁县| 精河县| 尼玛县| 鄂托克前旗| 兰坪| 铜鼓县| 苏尼特右旗| 阿克苏市| 余干县| 仁怀市| 兴海县| 交口县| 锦州市| 仙游县| 清涧县| 平遥县| 安达市| 全州县| 华宁县| 印江| 满城县| 呼和浩特市| 昌吉市| 长寿区| 日喀则市| 谢通门县| 扎兰屯市| 民县| 泸定县| 都江堰市|