Combinatorial Algorithms: 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings: Lecture Notes in Computer Science, cartea 10979
Editat de Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sungen Limba Engleză Paperback – 4 iul 2018
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 331.22 lei
Preț vechi: 414.03 lei
-20% Nou
Puncte Express: 497
Preț estimativ în valută:
63.39€ • 65.84$ • 52.65£
63.39€ • 65.84$ • 52.65£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319946665
ISBN-10: 3319946668
Pagini: 371
Ilustrații: XIX, 388 p. 78 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.57 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
ISBN-10: 3319946668
Pagini: 371
Ilustrații: XIX, 388 p. 78 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.57 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
Cuprins
Some Recent New Directions in Multivariate Algorithmics.- Survey of some recent near polynomial time results for Parity Games.- Range Minimum Queries and Applications.- Collision-free Routing Problem with Restricted L-path.- Linear clique-width of bi-complement reducible graphs.- Linear Ramsey numbers.- Graphs that are Not Pairwise Compatible: A New Proof Technique Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families.- Minimum Polygons for Fixed Visibility VC-Dimension.- Minsum k-Sink Problem on Dynamic Flow Path Networks.- Fully leafed induced subtrees.- Pattern matching for k--track permutations.- Approximation algorithms for the p-hub center routing problem in parameterized metric graphs.- On the Area Requirements of Straight-Line Orthogonal Drawings of A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs.- Covering with Clubs: Complexity and Approximability.- On the Expected Number of Distinct Gapped Palindromic Factors.- Computational Complexity of Robot Arm Simulation Problems.- Evaluation of Tie-breaking and Parameter ordering for the IPO Family of Algorithms used in Covering Array Generation.- Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth.- An Optimal Algorithm for Online Prize-collecting Node-weighted Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem.- Structural Parameterizations for Colorful Components.- Analysis of Information Leakage due to Operative Errors in Card-based Protocols.- Zero-Suppression and Computation Models.- The Crossing Number of Seq-Shellable Drawings of Complete Graphs.- Cryptographic limitations on polynomial-time a posteriori query learning.- Placing Segments On Parallel Arcs.- Branch-and-bound algorithm for Symmetric Travelling Salesman Problem.- LZ-ABT: A Practical Algorithm for nalpha-Balanced Grammar Compression.- Faster Coreset Construction for Projective Clustering via Low-Rank Approximation.- Separating Interaction Effects Using Locating and Detecting Arrays.- An Efficient Representation of Partitions of Integers.- How far from a worst solution a random solution of a k-CSP instance can be?.