東華大學圖書館 |

Combinatorial algorithms = 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Combinatorial algorithms/ edited by Veli Makinen, Simon J. Puglisi, Leena Salmela.
其他題名:	27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016 : proceedings /
其他題名:	IWOCA 2016
其他作者:	Makinen, Veli.
出版者:	Cham :Springer International Publishing : : 2016.,
面頁冊數:	xx, 462 p. :ill., digital ;24 cm.
內容註:	Computational complexity -- On the complexity of computing the tree-breadth -- Online Chromatic Number is PSPACE-Complete -- Computational geometry -- Bounded embeddings of graphs in the plane -- Crushing Disks Efficiently -- Essential Constraints of Edge-Constrained Proximity Graphs -- Plane Bichromatic Trees of Low Degree -- Networks -- Directing Road Networks by Listing Strong Orientations -- Evangelism in Social Networks -- Distance Queries in Large-Scale Fully Dynamic Complex Networks -- Minimax Regret 1-Median Problem in Dynamic Path Networks -- Enumeration -- On Maximal Chain Subgraphs and Covers of Bipartite Graphs -- Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations -- Reconfiguration of Steiner Trees in an Unweighted Graph -- Online algorithms -- Weighted Online Problems with Advice -- Finding gapped palindromes online -- Advice Complexity of the Online Search Problem -- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing -- Algorithmic graph theory -- A boundary property for upper domination -- Upper Domination: Complexity and Approximation -- Well-quasi-ordering versus clique-width: new results on bigenic classes -- Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles -- Dynamic programming -- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees -- Speeding up dynamic programming in the line-constrained k-median -- Combinatorial algorithms -- SOBRA - Shielding Optimization for BRAchytherapy -- A bit-scaling algorithm for integer feasibility in UTVPI constraints -- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem -- Exact Algorithms For Weighted Coloring In Special Classes of Tree and Cactus Graphs -- Graph algorithms -- Finding Cactus Roots in Polynomial Time -- Computing Giant Graph Diameters -- Faster Computation of Path-Width -- The Solution Space of Sorting with Recurring Comparison Faults -- Combinatorics -- Monotone paths in geometric triangulations -- On computing the total displacement number via weighted Motzkin paths -- Probabilistics -- Partial Covering Arrays: Algorithms and Asymptotics -- Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently.
Contained By:	Springer eBooks
標題:	Combinatorial analysis -
電子資源:	http://dx.doi.org/10.1007/978-3-319-44543-4
ISBN:	9783319445434

Combinatorial algorithms = 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016 : proceedings /
Combinatorial algorithms27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016 : proceedings /[electronic resource] :IWOCA 2016edited by Veli Makinen, Simon J. Puglisi, Leena Salmela. - Cham :Springer International Publishing :2016. - xx, 462 p. :ill., digital ;24 cm. - Lecture notes in computer science,98430302-9743 ;. - Lecture notes in computer science ;5353..

Computational complexity -- On the complexity of computing the tree-breadth -- Online Chromatic Number is PSPACE-Complete -- Computational geometry -- Bounded embeddings of graphs in the plane -- Crushing Disks Efficiently -- Essential Constraints of Edge-Constrained Proximity Graphs -- Plane Bichromatic Trees of Low Degree -- Networks -- Directing Road Networks by Listing Strong Orientations -- Evangelism in Social Networks -- Distance Queries in Large-Scale Fully Dynamic Complex Networks -- Minimax Regret 1-Median Problem in Dynamic Path Networks -- Enumeration -- On Maximal Chain Subgraphs and Covers of Bipartite Graphs -- Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations -- Reconfiguration of Steiner Trees in an Unweighted Graph -- Online algorithms -- Weighted Online Problems with Advice -- Finding gapped palindromes online -- Advice Complexity of the Online Search Problem -- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing -- Algorithmic graph theory -- A boundary property for upper domination -- Upper Domination: Complexity and Approximation -- Well-quasi-ordering versus clique-width: new results on bigenic classes -- Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles -- Dynamic programming -- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees -- Speeding up dynamic programming in the line-constrained k-median -- Combinatorial algorithms -- SOBRA - Shielding Optimization for BRAchytherapy -- A bit-scaling algorithm for integer feasibility in UTVPI constraints -- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem -- Exact Algorithms For Weighted Coloring In Special Classes of Tree and Cactus Graphs -- Graph algorithms -- Finding Cactus Roots in Polynomial Time -- Computing Giant Graph Diameters -- Faster Computation of Path-Width -- The Solution Space of Sorting with Recurring Comparison Faults -- Combinatorics -- Monotone paths in geometric triangulations -- On computing the total displacement number via weighted Motzkin paths -- Probabilistics -- Partial Covering Arrays: Algorithms and Asymptotics -- Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently.

This book constitutes the proceedings of the 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, held in Helsinki, Finland, in August 2016. The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combinatorial algorithms; graph algorithms; combinatorics; and probabilistics.

ISBN: 9783319445434

Standard No.: 10.1007/978-3-319-44543-4doiSubjects--Topical Terms:

1236043
Combinatorial analysis

LC Class. No.: QA76.9.M35

Dewey Class. No.: 511.6

Combinatorial algorithms = 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016 : proceedings /
LDR:03960nmm a2200361 a 4500 001 2047793
003 DE-He213
005 20160808155145.0
006 m d
007 cr nn 008maaau
008 170319s2016 gw s 0 eng d
020 $a 9783319445434 $q (electronic bk.)
020 $a 9783319445427 $q (paper)
024 7 $a 10.1007/978-3-319-44543-4 $2 doi
035 $a 978-3-319-44543-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a MAT008000 $2 bisacsh
082 0 4 $a 511.6 $2 23
090 $a QA76.9.M35 $b I61 2016
245 1 0 $a Combinatorial algorithms $h [electronic resource] : $b 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016 : proceedings / $c edited by Veli Makinen, Simon J. Puglisi, Leena Salmela.
246 3 $a IWOCA 2016
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xx, 462 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9843
505 0 $a Computational complexity -- On the complexity of computing the tree-breadth -- Online Chromatic Number is PSPACE-Complete -- Computational geometry -- Bounded embeddings of graphs in the plane -- Crushing Disks Efficiently -- Essential Constraints of Edge-Constrained Proximity Graphs -- Plane Bichromatic Trees of Low Degree -- Networks -- Directing Road Networks by Listing Strong Orientations -- Evangelism in Social Networks -- Distance Queries in Large-Scale Fully Dynamic Complex Networks -- Minimax Regret 1-Median Problem in Dynamic Path Networks -- Enumeration -- On Maximal Chain Subgraphs and Covers of Bipartite Graphs -- Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations -- Reconfiguration of Steiner Trees in an Unweighted Graph -- Online algorithms -- Weighted Online Problems with Advice -- Finding gapped palindromes online -- Advice Complexity of the Online Search Problem -- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing -- Algorithmic graph theory -- A boundary property for upper domination -- Upper Domination: Complexity and Approximation -- Well-quasi-ordering versus clique-width: new results on bigenic classes -- Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles -- Dynamic programming -- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees -- Speeding up dynamic programming in the line-constrained k-median -- Combinatorial algorithms -- SOBRA - Shielding Optimization for BRAchytherapy -- A bit-scaling algorithm for integer feasibility in UTVPI constraints -- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem -- Exact Algorithms For Weighted Coloring In Special Classes of Tree and Cactus Graphs -- Graph algorithms -- Finding Cactus Roots in Polynomial Time -- Computing Giant Graph Diameters -- Faster Computation of Path-Width -- The Solution Space of Sorting with Recurring Comparison Faults -- Combinatorics -- Monotone paths in geometric triangulations -- On computing the total displacement number via weighted Motzkin paths -- Probabilistics -- Partial Covering Arrays: Algorithms and Asymptotics -- Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently.
520 $a This book constitutes the proceedings of the 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, held in Helsinki, Finland, in August 2016. The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combinatorial algorithms; graph algorithms; combinatorics; and probabilistics.
650 0 $a Combinatorial analysis $3 1236043
650 0 $a Computer algorithms $v Congresses. $3 1243504
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Combinatorics. $3 895617
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
650 2 4 $a Data Structures. $3 891009
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
700 1 $a Makinen, Veli. $3 2209951
700 1 $a Puglisi, Simon J. $3 2209952
700 1 $a Salmela, Leena. $3 2209953
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-44543-4
950 $a Computer Science (Springer-11645)