東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

New Algorithmic Solutions for Some Clustering and Network Design Problems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	New Algorithmic Solutions for Some Clustering and Network Design Problems./
作者:	Guo, Xiangyu.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2022,
面頁冊數:	192 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-12, Section: B.
Contained By:	Dissertations Abstracts International83-12B.
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29206033
ISBN:	9798819394687

New Algorithmic Solutions for Some Clustering and Network Design Problems.
Guo, Xiangyu.

New Algorithmic Solutions for Some Clustering and Network Design Problems. - Ann Arbor : ProQuest Dissertations & Theses, 2022 - 192 p.

Source: Dissertations Abstracts International, Volume: 83-12, Section: B.

Thesis (Ph.D.)--State University of New York at Buffalo, 2022.

This item must not be sold to any third party vendors.

The thesis is formed by two parts, where we consider two prominent types of combinatorial optimization problem, namely clustering and network design problems.In the first part, we study clustering problems under various computation models inspired by modern data analysis tasks. Specifically, we study clustering tasks on distributed, dynamic, or online data input, with possible noise-tolerance requirement. These new computation models often incur extra problem dimensions, e.g. communication cost (in the distributed setting), or stability and response time (in the dynamic and online setting). We propose algorithms for several classical clustering problems under the aforementioned set- tings, including (noise-tolerant) k-center, k-means, k-median, and the closely-related facility location problem.The second part is devoted to degree-bounded network design problems. The degree constraints require the degree of each node being bounded by certain quantity, which often makes a network design problem much harder. We aim to design algorithms for several fundamental network design problems with degree constraints, including Group Steiner Tree (on Trees), Directed Steiner Tree, and Single-Commodity Buy-at-Bulk.

ISBN: 9798819394687Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

Approximation algorithm

New Algorithmic Solutions for Some Clustering and Network Design Problems.
LDR:02511nmm a2200409 4500 001 2349013
005 20220920134645.5
008 241004s2022 ||||||||||||||||| ||eng d
020 $a 9798819394687
035 $a (MiAaPQ)AAI29206033
035 $a AAI29206033
040 $a MiAaPQ $c MiAaPQ
100 1 $a Guo, Xiangyu. $3 3681229
245 1 0 $a New Algorithmic Solutions for Some Clustering and Network Design Problems.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2022
300 $a 192 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-12, Section: B.
500 $a Advisor: Li, Shi.
502 $a Thesis (Ph.D.)--State University of New York at Buffalo, 2022.
506 $a This item must not be sold to any third party vendors.
506 $a This item must not be added to any third party search indexes.
520 $a The thesis is formed by two parts, where we consider two prominent types of combinatorial optimization problem, namely clustering and network design problems.In the first part, we study clustering problems under various computation models inspired by modern data analysis tasks. Specifically, we study clustering tasks on distributed, dynamic, or online data input, with possible noise-tolerance requirement. These new computation models often incur extra problem dimensions, e.g. communication cost (in the distributed setting), or stability and response time (in the dynamic and online setting). We propose algorithms for several classical clustering problems under the aforementioned set- tings, including (noise-tolerant) k-center, k-means, k-median, and the closely-related facility location problem.The second part is devoted to degree-bounded network design problems. The degree constraints require the degree of each node being bounded by certain quantity, which often makes a network design problem much harder. We aim to design algorithms for several fundamental network design problems with degree constraints, including Group Steiner Tree (on Trees), Directed Steiner Tree, and Single-Commodity Buy-at-Bulk.
590 $a School code: 0656.
650 4 $a Computer science. $3 523869
650 4 $a Computer engineering. $3 621879
650 4 $a Applied mathematics. $3 2122814
650 4 $a Information technology. $3 532993
650 4 $a Information science. $3 554358
653 $a Approximation algorithm
653 $a Clustering
653 $a Linear programming
653 $a Network design
653 $a Online algorithm
690 $a 0984
690 $a 0489
690 $a 0464
690 $a 0723
690 $a 0364
710 2 $a State University of New York at Buffalo. $b Computer Science and Engineering. $3 1035503
773 0 $t Dissertations Abstracts International $g 83-12B.
790 $a 0656
791 $a Ph.D.
792 $a 2022
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29206033