Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II: Lecture Notes in Computer Science, cartea 6509
Editat de Weili Wu, Ovidiu Daescuen Limba Engleză Paperback – 9 dec 2010
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 327.36 lei
Preț vechi: 409.20 lei
-20%
Puncte Express: 491
Carte disponibilă
Livrare economică 17 iunie-01 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783642174605
ISBN-10: 3642174604
Pagini: 432
Ilustrații: XVI, 416 p. 80 illus.
Greutate: 0.64 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642174604
Pagini: 432
Ilustrații: XVI, 416 p. 80 illus.
Greutate: 0.64 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Coverage with k-Transmitters in the Presence of Obstacles.- On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem.- Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations.- Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks.- Time Optimal Algorithms for Black Hole Search in Rings.- Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle.- A Constant-Factor Approximation Algorithm for the Link Building Problem.- XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme.- Computational Study for Planar Connected Dominating Set Problem.- Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives.- A Search-Based Approach to the Railway Rolling Stock Allocation Problem.- Approximation Algorithm for the Minimum Directed Tree Cover.- An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs.- A New Result on [k,k?+?1]-Factors Containing Given Hamiltonian Cycles.- Yao Graphs Span Theta Graphs.- A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time.- New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs.- A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem.- Fast Edge-Searching and Related Problems.- Diameter-Constrained Steiner Tree.- Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks.- A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree.- Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor Networks.- Structured Overlay Network for File Distribution.- Optimal Balancing of Satellite Queues inPacket Transmission to Ground Stations.- The Networked Common Goods Game.- A Novel Branching Strategy for Parameterized Graph Modification Problems.- Listing Triconnected Rooted Plane Graphs.- Bipartite Permutation Graphs Are Reconstructible.- A Transformation from PPTL to S1S.- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs.- Approximate Ellipsoid in the Streaming Model.