東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithms and complexity = 9th Inte...

Paschos, Vangelis Th.

FindBook

Google Book

Amazon

博客來

Algorithms and complexity = 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms and complexity/ edited by Vangelis Th. Paschos, Peter Widmayer.
其他題名:	9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015 : proceedings /
其他作者:	Paschos, Vangelis Th.
出版者:	Cham :Springer International Publishing : : 2015.,
面頁冊數:	xv, 430 p. :ill., digital ;24 cm.
內容註:	Communication, Dynamics and Renormalization -- Fast and Powerful Hashing using Tabulation -- Green Barrier Coverage with Mobile Sensors -- A Reﬁned Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths -- Orthogonal Graph Drawing with Inﬂexible Edges -- Linear time Constructions of some d-Restriction Problems -- Eﬃciently Testing T-Interval Connectivity in Dynamic Graphs -- Competitive Strategies for Online Clique Clustering -- Scheduling with Gaps: New Models and Algorithms -- MinMax-Distance Gathering on given Meeting Points -- Evacuating Robots from a Disk Using Face-to-Face Communication -- Planarity of Streamed Graphs -- Clique-width of Graph Classes Deﬁned by Two Forbidden Induced Subgraphs -- Randomized Adaptive Test Cover -- Contraction Blockers for Graphs with Forbidden Induced Paths -- Label Placement in Road Maps -- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Oﬄine -- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints -- Simple strategies versus optimal schedules in multi-agent patrolling -- Sharing Non-Anonymous Costs of Multiple Resources Optimally -- Algorithms solving the Matching Cut problem -- End-Vertices of Graph Search Algorithms -- Deciding the On-line Chromatic Number of a Graph with Pre-coloring is PSPACE-complete -- A Lex-BFS-based recognition algorithm for Robinsonian matrices -- Mixed Map Labeling -- Optimal Online Edge Coloring of Planar Graphs with Advice -- Approximability of Two Variants of Multiple Knapsack -- Block Sorting is Hard -- An opportunistic text indexing structure based on run length encoding -- PSPACE-completeness of Bloxorz and of Games with 2-Buttons -- Advice Complexity of Fine-Grained Job Shop Scheduling.
Contained By:	Springer eBooks
標題:	Computer algorithms - Congresses. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-18173-8
ISBN:	9783319181738 (electronic bk.)

Algorithms and complexity = 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015 : proceedings /
Algorithms and complexity9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015 : proceedings /[electronic resource] :edited by Vangelis Th. Paschos, Peter Widmayer. - Cham :Springer International Publishing :2015. - xv, 430 p. :ill., digital ;24 cm. - Lecture notes in computer science,90790302-9743 ;. - Lecture notes in computer science ;5353..

Communication, Dynamics and Renormalization -- Fast and Powerful Hashing using Tabulation -- Green Barrier Coverage with Mobile Sensors -- A Reﬁned Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths -- Orthogonal Graph Drawing with Inﬂexible Edges -- Linear time Constructions of some d-Restriction Problems -- Eﬃciently Testing T-Interval Connectivity in Dynamic Graphs -- Competitive Strategies for Online Clique Clustering -- Scheduling with Gaps: New Models and Algorithms -- MinMax-Distance Gathering on given Meeting Points -- Evacuating Robots from a Disk Using Face-to-Face Communication -- Planarity of Streamed Graphs -- Clique-width of Graph Classes Deﬁned by Two Forbidden Induced Subgraphs -- Randomized Adaptive Test Cover -- Contraction Blockers for Graphs with Forbidden Induced Paths -- Label Placement in Road Maps -- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Oﬄine -- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints -- Simple strategies versus optimal schedules in multi-agent patrolling -- Sharing Non-Anonymous Costs of Multiple Resources Optimally -- Algorithms solving the Matching Cut problem -- End-Vertices of Graph Search Algorithms -- Deciding the On-line Chromatic Number of a Graph with Pre-coloring is PSPACE-complete -- A Lex-BFS-based recognition algorithm for Robinsonian matrices -- Mixed Map Labeling -- Optimal Online Edge Coloring of Planar Graphs with Advice -- Approximability of Two Variants of Multiple Knapsack -- Block Sorting is Hard -- An opportunistic text indexing structure based on run length encoding -- PSPACE-completeness of Bloxorz and of Games with 2-Buttons -- Advice Complexity of Fine-Grained Job Shop Scheduling.

This book constitutes the refereed conference proceedings of the 9th International Conference on Algorithms and Complexity, CIAC 2015, held in Paris, France, in May 2015. The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.

ISBN: 9783319181738 (electronic bk.)

Standard No.: 10.1007/978-3-319-18173-8doiSubjects--Topical Terms:

1243504
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Algorithms and complexity = 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015 : proceedings /
LDR:03286nmm a2200325 a 4500 001 2006297
003 DE-He213
005 20151223114952.0
006 m d
007 cr nn 008maaau
008 160114s2015 gw s 0 eng d
020 $a 9783319181738 (electronic bk.)
020 $a 9783319181721 (paper)
024 7 $a 10.1007/978-3-319-18173-8 $2 doi
035 $a 978-3-319-18173-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b I61 2015
245 1 0 $a Algorithms and complexity $h [electronic resource] : $b 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015 : proceedings / $c edited by Vangelis Th. Paschos, Peter Widmayer.
260 $a Cham : $c 2015. $b Springer International Publishing : $b Imprint: Springer,
300 $a xv, 430 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9079
505 0 $a Communication, Dynamics and Renormalization -- Fast and Powerful Hashing using Tabulation -- Green Barrier Coverage with Mobile Sensors -- A Reﬁned Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths -- Orthogonal Graph Drawing with Inﬂexible Edges -- Linear time Constructions of some d-Restriction Problems -- Eﬃciently Testing T-Interval Connectivity in Dynamic Graphs -- Competitive Strategies for Online Clique Clustering -- Scheduling with Gaps: New Models and Algorithms -- MinMax-Distance Gathering on given Meeting Points -- Evacuating Robots from a Disk Using Face-to-Face Communication -- Planarity of Streamed Graphs -- Clique-width of Graph Classes Deﬁned by Two Forbidden Induced Subgraphs -- Randomized Adaptive Test Cover -- Contraction Blockers for Graphs with Forbidden Induced Paths -- Label Placement in Road Maps -- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Oﬄine -- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints -- Simple strategies versus optimal schedules in multi-agent patrolling -- Sharing Non-Anonymous Costs of Multiple Resources Optimally -- Algorithms solving the Matching Cut problem -- End-Vertices of Graph Search Algorithms -- Deciding the On-line Chromatic Number of a Graph with Pre-coloring is PSPACE-complete -- A Lex-BFS-based recognition algorithm for Robinsonian matrices -- Mixed Map Labeling -- Optimal Online Edge Coloring of Planar Graphs with Advice -- Approximability of Two Variants of Multiple Knapsack -- Block Sorting is Hard -- An opportunistic text indexing structure based on run length encoding -- PSPACE-completeness of Bloxorz and of Games with 2-Buttons -- Advice Complexity of Fine-Grained Job Shop Scheduling.
520 $a This book constitutes the refereed conference proceedings of the 9th International Conference on Algorithms and Complexity, CIAC 2015, held in Paris, France, in May 2015. The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.
650 0 $a Computer algorithms $v Congresses. $3 1243504
650 0 $a Computational complexity $3 1530875
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Data Structures. $3 891009
700 1 $a Paschos, Vangelis Th. $3 1314724
700 1 $a Widmayer, Peter. $3 1070823
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 5353. $x 0302-9743 $3 1274248
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-18173-8
950 $a Computer Science (Springer-11645)