Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Lingua: inglese

Editore: Springer, Springer Aug 2009, 2009

3642036848 / 9783642036842

Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000

Venditore con 5 stelle

Venditore AbeBooks dal 23 gennaio 2017

Visualizza gli articoli di questo venditore
Brossura

Condizione: Nuovo

EUR 106,99

EUR 60,00 spedizione 
Spedito da Germania a U.S.A.

Quantità: 1 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

This item is printed on demand - Print on Demand Titel. Neuware -Contributed Talks of APPROX.- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs.- Adaptive Sampling for k-Means Clustering.- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs.- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs.- Truthful Mechanisms via Greedy Iterative Packing.- Resource Minimization Job Scheduling.- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders.- New Hardness Results for Diophantine Approximation.- PASS Approximation.- Optimal Sherali-Adams Gaps from Pairwise Independence.- An Approximation Scheme for Terrain Guarding.- Scheduling with Outliers.- Improved Inapproximability Results for Maximum k-Colorable Subgraph.- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems.- On the Optimality of Gluing over Scales.- On Hardness of Pricing Items for Single-Minded Bidders.- Real-Time Message Routing and Scheduling.- Approximating Some Network Design Problems with Node Costs.- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties.- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy.- Minimizing Average Shortest Path Distances via Shortcut Edge Addition.- Approximating Node-Connectivity Augmentation Problems.- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs.- On the Complexity of the Asymmetric VPN Problem.- Contributed Talks of RANDOM.- Deterministic Approximation Algorithms for the Nearest Codeword Problem.- Strong Parallel Repetition Theorem for Free Projection Games.- Random Low Degree Polynomials are Hard to Approximate.- Composition of Semi-LTCs by Two-Wise Tensor Products.- On the Security of Goldreich's One-Way Function.- Random Tensors and Planted Cliques.- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry.- Average-Case Analyses of Vickrey Costs.- A Hypergraph Dictatorship Test with Perfect Completeness.- Extractors Using Hardness Amplification.- How Well Do Random Walks Parallelize .- An Analysis of Random-Walk Cuckoo Hashing.- Hierarchy Theorems for Property Testing.- Algorithmic Aspects of Property Testing in the Dense Graphs Model.- Succinct Representation of Codes with Applications to Testing.- Efficient Quantum Tensor Product Expanders and k-Designs.- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND.- Pseudorandom Generators and Typically-Correct Derandomization.- Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions.- Tolerant Linearity Testing and Locally Testable Codes.- Pseudorandom Bit Generators That Fool Modular Sums.- The Glauber Dynamics for Colourings of Bounded Degree Trees.- Testing ±1-weight halfspace.- Small-Bias Spaces for Group Products.- Small Clique Detection and Approximate Nash Equilibria.- Testing Computability by Width Two OBDDs.- Improved Polynomial Identity Testing for Read-Once Formulas.- Smooth Analysis of the Condition Number and the Least Singular Value.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 756 pp. Englisch.

Codice articolo 9783642036842

Titolo
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Autore
Irit Dinur
Editore
Springer, Springer Aug 2009
Anno di pubblicazione
2009
Condizione
Neu
Rilegatura
Taschenbuch
Lingua
inglese
ISBN 10
3642036848
ISBN 13
9783642036842
Peso dell'articolo
1124 grammi
Dimensioni
235x155x41 mm

buchversandmimpf2000

Emtmannsberg, BAYE, Germania

Venditore con 5 stelle

Venditore AbeBooks dal 23 gennaio 2017

Tariffe di spedizione da Germania a U.S.A.

ArticoloDa 60 a 60 giorni lavorativiDa 60 a 60 giorni lavorativi
Primo articoloEUR 60,00EUR 75,00
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay
  • Assegno
  • PayPal

Descrizione dello Store

Impressum Thorsten Retsch Buchversand Mimpf2000 Oberölschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir führen gebrauchte Bücher aus allen Sparten der Literatur

Specializzazione

Modernes Antiquariat - Bücher von 1960 bis heute

Informazioni sull’azienda del venditore

buchversandmimpf2000

Germania