Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings: Lecture Notes in Computer Science, cartea 8096
Editat de Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolimen Limba Engleză Paperback – 6 aug 2013
Din seria Lecture Notes in Computer Science
- 20% Preț: 1005.39 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.19 lei
- 20% Preț: 238.01 lei
- 20% Preț: 554.98 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 782.28 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 550.29 lei
- 20% Preț: 560.32 lei
- 20% Preț: 319.32 lei
- 15% Preț: 549.86 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 548.74 lei
- 20% Preț: 172.69 lei
- 20% Preț: 611.22 lei
- 20% Preț: 970.25 lei
- 20% Preț: 552.64 lei
- 20% Preț: 315.78 lei
- 20% Preț: 315.78 lei
- 20% Preț: 722.90 lei
- 20% Preț: 722.90 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.94 lei
- 20% Preț: 552.64 lei
- Preț: 389.31 lei
- 20% Preț: 564.99 lei
- 20% Preț: 724.49 lei
- 20% Preț: 552.64 lei
- 20% Preț: 1018.35 lei
- 20% Preț: 331.82 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 335.27 lei
Preț vechi: 419.08 lei
-20% Nou
Puncte Express: 503
Preț estimativ în valută:
64.22€ • 69.62$ • 53.38£
64.22€ • 69.62$ • 53.38£
Carte tipărită la comandă
Livrare economică 02-16 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642403279
ISBN-10: 3642403271
Pagini: 732
Ilustrații: XIV, 716 p. 48 illus.
Dimensiuni: 155 x 235 x 40 mm
Greutate: 1.01 kg
Ediția:2013
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: 3642403271
Pagini: 732
Ilustrații: XIV, 716 p. 48 illus.
Dimensiuni: 155 x 235 x 40 mm
Greutate: 1.01 kg
Ediția:2013
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
Spectral Sparsification in Dynamic Graph Streams.- The Online Stochastic Generalized Assignment Problem.- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems.- Approximating Large Frequency Moments with Pick-and-Drop Sampling.- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams.- Capacitated Network Design on Undirected Graphs.- Scheduling Subset Tests: One-Time, Continuous, and How They Relate.- On the Total Perimeter of Homothetic Convex Bodies in a Convex Container.- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality.- Online Square-into-Square Packing.- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions.- Shrinking Maxima, Decreasing Costs: New Online Packing andCovering Problems.- Multiple Traveling Salesmen in Asymmetric Metrics.- Approximate Indexability and Bandit Problems with Concave Rewardsand Delayed Feedback.- The Approximability of the Binary Paintshop Problem.- Approximation Algorithms for Movement Repairmen.- Improved Hardness of Approximating Chromatic Number.- A Pseudo-approximation for the Genus of Hamiltonian Graphs.- A Local Computation Approximation Scheme to Maximum Matching.- Sketching Earth-Mover Distance on Graph Metrics.- Online Multidimensional Load Balancing.- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs.- Interdiction Problems on Planar Graphs.- Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration.- Finding Heavy Hitters from Lossy or Noisy Data.- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy.- Phase Coexistence and Slow Mixing for the Hard-Core Model on Z2.- Fast Private Data Release Algorithms for Sparse Queries.- Local Reconstructors and Tolerant Testers for Connectivity and Diameter.- An Optimal Lower Bound for Monotonicity Testing over Hypergrids.- Small-Bias Sets for NonabelianGroups: Derandomizations of the Alon-Roichman Theorem.- What You Can Do with Coordinated Samples.- Robust Randomness Amplifiers: Upper and Lower Bounds.- The Power of Choice for Random Satisfiability.- Connectivity of Random High Dimensional Geometric Graphs.- Matching-Vector Families and LDCs over Large Modulo.- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing.- Testing Membership in Counter Automaton Languages.- Tight Lower Bounds for Testing Linear Isomorphism.- Randomness-Efficient Curve Samplers.- Combinatorial Limitations of Average-Radius List Decoding.- Zero Knowledge LTCs and Their Applications.- A Tight Lower Bound for High Frequency Moment Estimation with Small Error.- Improved FPTAS for Multi-spin Systems.- Pseudorandomness for Regular Branching Programs via Fourier Analysis.- Absolutely Sound Testing of Lifted Codes.- On the Average Sensitivity and Density of k-CNF Formulas.- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions.
Caracteristici
Conference Proceedings of the International Workshop on Approximation, Randomization, and Combinatorial Optimization