Combinatorial algorithms : 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings /: 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings. (2016)

• Record Type: Book
• Other Titles: IWOCA 2016
• Further Information: Note: Veli Mäkinen, Simon J. Puglisi, Leena Salmela (eds.).
• Editors: Mäkinen, Veli; Puglisi, Simon J; Salmela, Leena
• Other Names: International Workshop on Combinatorial Algorithms, 27th
• Contents: 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.
• Publisher Details: Switzerland : Springer
• Publication Date: 2016
• Extent: 1 online resource (xx, 462 pages), illustrations
• Subjects: 511/.6; Computer science; Combinatorial analysis -- Congresses; Computer algorithms -- Congresses; Combinatorial analysis; Computer algorithms; Mathematics -- Combinatorics; Computers -- Programming -- Algorithms; Mathematics -- Logic; Computers -- Data Modeling & Design; Computers -- Intelligence (AI) & Semantics; Combinatorics & graph theory; Algorithms & data structures; Mathematical theory of computation; Artificial intelligence; Computational complexity; Combinatorics; Computer software; Data structures (Computer science); Artificial intelligence; Computers -- Data Processing; Discrete mathematics; Electronic books; Conference papers and proceedings; Electronic books
• Languages: English
• ISBNs: 9783319445434
• Related ISBNs: 331944543X; 9783319445427; 3319445421
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed August 22, 2016).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.