000 05390nam a22006735i 4500
001 978-3-319-44543-4
003 DE-He213
005 20240730182846.0
007 cr nn 008mamaa
008 160808s2016 sz | s |||| 0|eng d
020 _a9783319445434
_9978-3-319-44543-4
024 7 _a10.1007/978-3-319-44543-4
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aCombinatorial Algorithms
_h[electronic resource] :
_b27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings /
_cedited by Veli Mäkinen, Simon J. Puglisi, Leena Salmela.
250 _a1st ed. 2016.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2016.
300 _aXX, 462 p. 100 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9843
505 0 _aComputational 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 _aThis 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 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aAlgorithms.
_93390
650 0 _aMachine theory.
_9129476
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aArtificial intelligence.
_93407
650 1 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aDiscrete Mathematics.
_912873
650 2 4 _aAlgorithms.
_93390
650 2 4 _aFormal Languages and Automata Theory.
_9129477
650 2 4 _aData Science.
_934092
650 2 4 _aArtificial Intelligence.
_93407
700 1 _aMäkinen, Veli.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9129478
700 1 _aPuglisi, Simon J.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9129479
700 1 _aSalmela, Leena.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9129480
710 2 _aSpringerLink (Online service)
_9129481
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319445427
776 0 8 _iPrinted edition:
_z9783319445441
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9843
_9129482
856 4 0 _uhttps://doi.org/10.1007/978-3-319-44543-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91535
_d91535