找回密碼
 To register

QQ登錄

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

掃一掃，訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Optimal Interconnection Trees in the Plane; Theory, Algorithms a Marcus Brazil,Martin Zachariasen Textbook 2015 Springer International Publ

[復(fù)制鏈接]
查看: 30022|回復(fù): 35
樓主
發(fā)表于 2025-3-21 18:39:45 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱(chēng)Optimal Interconnection Trees in the Plane
副標(biāo)題Theory, Algorithms a
編輯Marcus Brazil,Martin Zachariasen
視頻videohttp://file.papertrans.cn/703/702886/702886.mp4
概述The first comprehensive book on the geometric Steiner tree problem since the 1990s.Clearly written proofs, supported by 120 color figures.Includes both the underlying mathematical theory and algorithm
叢書(shū)名稱(chēng)Algorithms and Combinatorics
圖書(shū)封面Titlebook: Optimal Interconnection Trees in the Plane; Theory, Algorithms a Marcus Brazil,Martin Zachariasen Textbook 2015 Springer International Publ
描述.This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such optimal interconnection networks can be understood across a wide range of metrics and cost functions. The book makes use of this mathematical theory to develop efficient algorithms for constructing such networks, with an emphasis on exact solutions..Marcus Brazil and Martin Zachariasen focus principally on the geometric structure of optimal interconnection networks, also known as Steiner trees, in the plane. They show readers how an understanding of this structure can lead to practical exact algorithms for constructing such trees.?.The book also details numerous breakthroughs in this area over the past 20 years, features clearly written proofs, and is supported by 135 colour and 15 black and white figures. It will help graduate students, working mathematicians, engineers and computer scientists to understand the principles required for designing interconnection networks in the plane that are as cost efficient as possible..
出版日期Textbook 2015
關(guān)鍵詞Network optimization; Steiner trees; algorithms; combinatorics; computational geometry
版次1
doihttps://doi.org/10.1007/978-3-319-13915-9
isbn_softcover978-3-319-35482-8
isbn_ebook978-3-319-13915-9Series ISSN 0937-5511 Series E-ISSN 2197-6783
issn_series 0937-5511
copyrightSpringer International Publishing Switzerland 2015
The information of publication is updating

書(shū)目名稱(chēng)Optimal Interconnection Trees in the Plane影響因子(影響力)




書(shū)目名稱(chēng)Optimal Interconnection Trees in the Plane影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Optimal Interconnection Trees in the Plane網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Optimal Interconnection Trees in the Plane網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Optimal Interconnection Trees in the Plane被引頻次




書(shū)目名稱(chēng)Optimal Interconnection Trees in the Plane被引頻次學(xué)科排名




書(shū)目名稱(chēng)Optimal Interconnection Trees in the Plane年度引用




書(shū)目名稱(chēng)Optimal Interconnection Trees in the Plane年度引用學(xué)科排名




書(shū)目名稱(chēng)Optimal Interconnection Trees in the Plane讀者反饋




書(shū)目名稱(chēng)Optimal Interconnection Trees in the Plane讀者反饋學(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
您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:04:38 | 只看該作者
板凳
發(fā)表于 2025-3-22 04:10:53 | 只看該作者
Steiner Trees with Other Cost Functions and Constraints,ons in the physical design of microchips; bottleneck and other .-Steiner tree problems, where there is a given bound on the number of Steiner points; and Steiner tree problems optimising a cost associated with flow on the network.
地板
發(fā)表于 2025-3-22 07:26:48 | 只看該作者
5#
發(fā)表于 2025-3-22 09:59:38 | 只看該作者
6#
發(fā)表于 2025-3-22 15:55:46 | 只看該作者
Rectilinear Steiner Trees,h some of the concepts in the earlier chapters, such as direction sets and canonical forms, is assumed. Here the fundamental properties are described in the first section, followed by global properties, two different algorithmic approaches and a discussion of special sets of points for which polynomial-time algorithms exist.
7#
發(fā)表于 2025-3-22 18:20:45 | 只看該作者
8#
發(fā)表于 2025-3-22 23:52:51 | 只看該作者
Fixed Orientation Steiner Trees,blem under a norm in which the unit ball is a centrally symmetric polygon. The chapter builds on some of the more general properties of normed Steiner trees from Chapter . Here the fundamental theory is developed in the first three sections, followed by discussions of global properties and algorithm
9#
發(fā)表于 2025-3-23 05:10:34 | 只看該作者
Rectilinear Steiner Trees,the design of microchips), is the subject of this chapter. We have attempted to make the chapter reasonably self-contained, although a familiarity with some of the concepts in the earlier chapters, such as direction sets and canonical forms, is assumed. Here the fundamental properties are described
10#
發(fā)表于 2025-3-23 09:24:50 | 只看該作者
Steiner Trees with Other Cost Functions and Constraints,) but that still can be solved exactly by exploiting the geometric properties of minimal solutions. We focus particularly on four types of Steiner tree problems: the gradient-constrained Steiner tree problem, which serves as another example of an exactly solvable Steiner tree problem in a Minkowski
 關(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-11 06:25
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
海城市| 青铜峡市| 兰州市| 乌什县| 桦川县| 三江| 墨竹工卡县| 商都县| 凤冈县| 泽库县| 高邮市| 郧西县| 斗六市| 辽阳市| 赤城县| 离岛区| 错那县| 静海县| 吴堡县| 且末县| 苍南县| 咸阳市| 松溪县| 博客| 社旗县| 浑源县| 东乡县| 吴忠市| 郑州市| 玉屏| 石景山区| 安徽省| 甘洛县| 合作市| 康平县| 怀宁县| 六安市| 阳原县| 墨江| 贵南县| 奉节县|