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
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 327.36 lei 3-5 săpt. | |
| Springer Berlin, Heidelberg – 9 dec 2010 | 327.36 lei 3-5 săpt. | |
| Springer Berlin, Heidelberg – 9 dec 2010 | 327.36 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 327.36 lei
Preț vechi: 409.20 lei
-20% Nou
Puncte Express: 491
Preț estimativ în valută:
57.92€ • 68.02$ • 50.84£
57.92€ • 68.02$ • 50.84£
Carte disponibilă
Livrare economică 06-20 ianuarie 26
Preluare comenzi: 021 569.72.76
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.