國立虎尾科技大學 |

Combinatorial Algorithms = 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Combinatorial Algorithms/ edited by Veli Mäkinen, Simon J. Puglisi, Leena Salmela.
Reminder of title:	27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings /
other author:	Mäkinen, Veli.
Description:	XX, 462 p. 100 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science—Mathematics. -
Online resource:	https://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] :edited by Veli Mäkinen, Simon J. Puglisi, Leena Salmela. - 1st ed. 2016. - XX, 462 p. 100 illus.online resource. - Theoretical Computer Science and General Issues ;9843. - Theoretical Computer Science and General Issues ;9163.

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:

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Combinatorial Algorithms = 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings /
LDR:04275nam a22004215i 4500 001 974898
003 DE-He213
005 20200706164939.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319445434 $9 978-3-319-44543-4
024 7 $a 10.1007/978-3-319-44543-4 $2 doi
035 $a 978-3-319-44543-4
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
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 Mäkinen, Simon J. Puglisi, Leena Salmela.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XX, 462 p. 100 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $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 Computer science—Mathematics. $3 1253519
650 0 $a Combinatorics. $3 669353
650 0 $a Algorithms. $3 527865
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Mäkinen, Veli. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1269561
700 1 $a Puglisi, Simon J. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1112394
700 1 $a Salmela, Leena. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1112395
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319445427
776 0 8 $i Printed edition: $z 9783319445441
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-44543-4
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)