東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

New algorithmic techniques for parti...

Wu, Xiaodong.

Linked to FindBook

Google Book

Amazon

博客來

New algorithmic techniques for partitioning and covering problems, with applications.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	New algorithmic techniques for partitioning and covering problems, with applications./
Author:	Wu, Xiaodong.
Description:	190 p.
Notes:	Director: Danny Z. Chen.
Contained By:	Dissertation Abstracts International63-03B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3047604
ISBN:	049362788X

New algorithmic techniques for partitioning and covering problems, with applications.
Wu, Xiaodong.

New algorithmic techniques for partitioning and covering problems, with applications. - 190 p.

Director: Danny Z. Chen.

Thesis (Ph.D.)--University of Notre Dame, 2002.

The partitioning and covering problems are very fundamental in combinatorial optimization and applications. In this dissertation, we consider a number of partitioning and covering problems, most of which are of interdisciplinary nature, such as optimal polygon cover problems, <italic>k</italic>-terminal cuts on planar graphs, pairwise data clustering, optimal net surface problems, and optimal terrain construction problems. These problems find applications in many fields, e.g., radiation therapy and radio-surgery, biomedical image analysis, data mining, VLSI circuit design, networking, computer vision, surface reconstruction, and material layout. Several general geometric and combinatorial techniques and algorithmic frameworks for solving these problems have been invented. Most of our algorithms are based on judicious combinations of geometric techniques, graph theory, and operations research. Our algorithms are either the first ones for solving the corresponding problems, or they significantly improve the previous best known algorithms, with respect to the time complexity and/or the quality of the output solutions.

ISBN: 049362788XSubjects--Topical Terms:

626642
Computer Science.

New algorithmic techniques for partitioning and covering problems, with applications.
LDR:01997nam 2200265 a 45 001 933692
005 20110506
008 110506s2002 eng d
020 $a 049362788X
035 $a (UnM)AAI3047604
035 $a AAI3047604
040 $a UnM $c UnM
100 1 $a Wu, Xiaodong. $3 907152
245 1 0 $a New algorithmic techniques for partitioning and covering problems, with applications.
300 $a 190 p.
500 $a Director: Danny Z. Chen.
500 $a Source: Dissertation Abstracts International, Volume: 63-03, Section: B, page: 1437.
502 $a Thesis (Ph.D.)--University of Notre Dame, 2002.
520 $a The partitioning and covering problems are very fundamental in combinatorial optimization and applications. In this dissertation, we consider a number of partitioning and covering problems, most of which are of interdisciplinary nature, such as optimal polygon cover problems, <italic>k</italic>-terminal cuts on planar graphs, pairwise data clustering, optimal net surface problems, and optimal terrain construction problems. These problems find applications in many fields, e.g., radiation therapy and radio-surgery, biomedical image analysis, data mining, VLSI circuit design, networking, computer vision, surface reconstruction, and material layout. Several general geometric and combinatorial techniques and algorithmic frameworks for solving these problems have been invented. Most of our algorithms are based on judicious combinations of geometric techniques, graph theory, and operations research. Our algorithms are either the first ones for solving the corresponding problems, or they significantly improve the previous best known algorithms, with respect to the time complexity and/or the quality of the output solutions.
590 $a School code: 0165.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Notre Dame. $3 807615
773 0 $t Dissertation Abstracts International $g 63-03B.
790 $a 0165
790 1 0 $a Chen, Danny Z., $e advisor
791 $a Ph.D.
792 $a 2002
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3047604