Computing and Combinatorics: 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4598
Editat de Guohui Linen Limba Engleză Paperback – 29 iun 2007
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 567.60 lei
- 20% Preț: 238.01 lei
- 15% Preț: 568.74 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 373.56 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 632.22 lei
- 20% Preț: 747.79 lei
- 20% Preț: 1053.45 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 809.19 lei
- 20% Preț: 579.56 lei
- 20% Preț: 649.49 lei
- 20% Preț: 330.23 lei
- Preț: 389.48 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 326.98 lei
- 20% Preț: 256.27 lei
- 20% Preț: 444.17 lei
- 20% Preț: 571.63 lei
- 20% Preț: 575.48 lei
- 20% Preț: 574.05 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ț: 747.79 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 569.19 lei
- 20% Preț: 1159.14 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 341.55 lei
Preț vechi: 426.94 lei
-20% Nou
Puncte Express: 512
Preț estimativ în valută:
65.37€ • 68.58$ • 54.23£
65.37€ • 68.58$ • 54.23£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540735441
ISBN-10: 3540735445
Pagini: 586
Ilustrații: XII, 572 p.
Dimensiuni: 155 x 235 x 34 mm
Greutate: 0.86 kg
Ediția:2007
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: 3540735445
Pagini: 586
Ilustrații: XII, 572 p.
Dimensiuni: 155 x 235 x 34 mm
Greutate: 0.86 kg
Ediția:2007
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
The Combinatorics of Sequencing the Corn Genome.- Online Frequency Assignment in Wireless Communication Networks.- Information Distance from a Question to an Answer.- A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy.- A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem.- Seed-Based Exclusion Method for Non-coding RNA Gene Search.- A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method.- Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data.- Improved Exact Algorithms for Counting 3- and 4-Colorings.- Connected Coloring Completion for General Graphs: Algorithms and Complexity.- Quadratic Kernelization for Convex Recoloring of Trees.- On the Number of Cycles in Planar Graphs.- An Improved Exact Algorithm for Cubic Graph TSP.- Geometric Intersection Graphs: Do Short Cycles Help?.- Dimension, Halfspaces, and the Density of Hard Sets.- Isolation Concepts for Enumerating Dense Subgraphs.- Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time.- Counting Minimum Weighted Dominating Sets.- Online Interval Scheduling: Randomized and Multiprocessor Cases.- Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.- Volume Computation Using a Direct Monte Carlo Method.- Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks.- Generating Minimal k-Vertex Connected Spanning Subgraphs.- Finding Many Optimal Paths Without Growing Any Optimal Path Trees.- Enumerating Constrained Non-crossing Geometric Spanning Trees.- Colored Simultaneous Geometric Embeddings.- Properties of Symmetric Incentive Compatible Auctions.- Finding Equilibria in Games of No Chance.- Efficient Testing of Forecasts.- When Does Greedy Learning of Relevant Attributes Succeed?.- The Informational Content of Canonical Disjoint NP-Pairs.- On the Representations of NC and Log-Space Real Numbers.- Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals.- Streaming Algorithms Measured in Terms of the Computed Quantity.- A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem.- Optimal Offline Extraction of Irredundant Motif Bases.- Linear Algorithm for Broadcasting in Unicyclic Graphs.- An Improved Algorithm for Online Unit Clustering.- Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.- Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions.- On the Hardness of Optimization in Power Law Graphs.- Can a Graph Have Distinct Regular Partitions?.- Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games.- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates.- On the Complexity of Finding an Unknown Cut Via Vertex Queries.- “Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas.- An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity.- Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.- Priority Algorithms for the Subset-Sum Problem.- Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families.- A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs.- Improved Algorithms for Weighted and Unweighted Set Splitting Problems.- An -Approximation Algorithm for a Hard Variant of Stable Marriage.- Approximation Algorithmsfor the Black and White Traveling Salesman Problem.