- 0 Ergebnisse
Kleinster Preis: € 11,91, größter Preis: € 125,04, Mittelwert: € 92,36
1
Bestellen
bei booklooker.de
€ 87,99
Versand: € 0,001
Bestellengesponserter Link
Herausgegeben von Serna, Maria Shaltiel, Ronen Jansen, Klaus Rolim, José:

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Taschenbuch

2010, ISBN: 9783642153686

[ED: Softcover], [PU: Springer, Berlin], This volume contains the papers presented at the 13th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) buecher.de GmbH & Co. KG
2
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 13th International Workshop, APPROX 2010, and 14th ... Notes in Computer Science, 6302, Band 6302)
Bestellen
bei amazon.de
€ 125,04
Versand: € 3,001
Bestellengesponserter Link
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 13th International Workshop, APPROX 2010, and 14th ... Notes in Computer Science, 6302, Band 6302) - Taschenbuch

2010, ISBN: 9783642153686

Springer, Taschenbuch, Auflage: 2010, 795 Seiten, Publiziert: 2010-08-19T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 31073554, 2.46 kg, Datenbanken, Computer & Internet, Kategorien, B… Mehr…

Versandkosten:Auf Lager. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) ausverkauf
3
Bestellen
bei buchfreund.de
€ 113,84
Versand: € 0,001
Bestellengesponserter Link
Serna, Maria, Ronen Shaltiel und Klaus Jansen:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings 2010 - gebrauchtes Buch

2010

ISBN: 9783642153686

2010 Neubindung, Buchkanten leicht angestoßen 8671951/12 Versandkostenfreie Lieferung graph theory,algorithms,combinatorial optimization,game theory,approximation algorithms,data structur… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Buchpark GmbH, 14959 Trebbin
4
Bestellen
bei Biblio.co.uk
$ 12,59
(ca. € 11,91)
Versand: € 18,921
Bestellengesponserter Link
Maria J. Serna (Editor), Ronen Shaltiel (Editor), Klaus Jansen (Editor), José Rolim (Editor):
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 13th International Workshop, APPROX 2010, and 14th ... Computer Science and General Issues) - Taschenbuch

2010, ISBN: 9783642153686

Springer, 2010-12-23. 2010. Paperback. Used:Good., Springer, 2010-12-23, 0

Versandkosten: EUR 18.92 Ergodebooks
5
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Maria Serna; Ronen Shaltiel; Klaus Jansen; José Rolim
Bestellen
bei lehmanns.de
€ 123,04
Versand: € 0,001
Bestellengesponserter Link
Maria Serna; Ronen Shaltiel; Klaus Jansen; José Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Taschenbuch

2010, ISBN: 9783642153686

13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springe… Mehr…

Versandkosten:sofort lieferbar. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.
Details zum Buch
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 13th International Workshop, APPROX 2010, and 14th ... Notes in Computer Science, 6302, Band 6302)

This book constitutes the joint refereed proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010, and the 14th International Workshop on Randomization and Computation, RANDOM 2010, held in Barcelona, Spain, in September 2010. The 28 revised full papers of the APPROX 2010 workshop and the 29 revised full papers of the RANDOM 2010 workshop included in this volume, were carefully reviewed and selected from 66 and 61 submissions, respectively. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.

Detailangaben zum Buch - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 13th International Workshop, APPROX 2010, and 14th ... Notes in Computer Science, 6302, Band 6302)


EAN (ISBN-13): 9783642153686
ISBN (ISBN-10): 3642153682
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Serna, Maria, Shaltiel, Ronen, Jansen, Klaus, Rolim, José, Springer
782 Seiten
Gewicht: 1,130 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-01-16T07:13:54+01:00 (Berlin)
Detailseite zuletzt geändert am 2022-05-09T19:42:47+02:00 (Berlin)
ISBN/EAN: 9783642153686

ISBN - alternative Schreibweisen:
3-642-15368-2, 978-3-642-15368-6


Daten vom Verlag:

Autor/in: Maria Serna; Ronen Shaltiel; Klaus Jansen; José Rolim
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings
Verlag: Springer; Springer Berlin
782 Seiten
Erscheinungsjahr: 2010-08-19
Berlin; Heidelberg; DE
Gewicht: 1,181 kg
Sprache: Englisch
123,04 € (DE)
126,49 € (AT)
153,65 CHF (CH)
POD
XIII, 782 p. 54 illus.

BC; Book; Hardcover, Softcover / Informatik, EDV/Informatik; Computerprogrammierung und Softwareentwicklung; Verstehen; algebraic codes; algorithm analysis; algorithms; approximation algorithms; coding theory; combinatorial optimization; combinatorics; complexity; e-learning; game theory; geometry; graph algorithms; graph theory; algorithm analysis and problem complexity; data structures; C; Programming Techniques; Computer Communication Networks; Theory of Computation; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Data Structures; Programming Techniques; Computer Communication Networks; Theory of Computation; Algorithms; Discrete Mathematics in Computer Science; Data Science; Computer Science; Netzwerk-Hardware; Theoretische Informatik; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Datenbanken; EA

Contributed Talks of APPROX.- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem.- Improved Inapproximability for Submodular Maximization.- Approximation Algorithms for the Directed k-Tour and k-Stroll Problems.- Submodular Secretary Problem and Extensions.- Approximation Algorithms for Min-Max Generalization Problems.- Min-Power Strong Connectivity.- The Complexity of Approximately Counting Stable Matchings.- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs.- Approximating Linear Threshold Predicates.- Approximating Sparsest Cut in Graphs of Bounded Treewidth.- On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors.- Vertex Sparsifiers: New Results from Old Techniques.- PTAS for Weighted Set Cover on Unit Squares.- Improved Lower Bounds for the Universal and a priori TSP.- Proximity Algorithms for Nearly-Doubling Spaces.- Matrix Sparsification and the Sparse Null Space Problem.- The Checkpoint Problem.- The Euclidean Distortion of Flat Tori.- Online Embeddings.- Approximation Algorithms for Intersection Graphs.- An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs.- Improved Algorithm for the Half-Disjoint Paths Problem.- Approximate Lasserre Integrality Gap for Unique Games.- Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses.- Maximum Flows on Disjoint Paths.- Approximation Algorithms for Reliable Stochastic Combinatorial Optimization.- How to Schedule When You Have to Buy Your Energy.- Improving Integrality Gaps via Chvátal-Gomory Rounding.- Contributed Talks of RANDOM.- Uniform Derandomization from Pathetic Lower Bounds.- Testing Boolean Function Isomorphism.- Better Size Estimation for Sparse Matrix Products.- Low Rate Is Insufficient for Local Testability.- Reconstruction Threshold for the Hardcore Model.- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners.- Monotonicity Testing and Shortest-Path Routing on the Cube.- Better Gap-Hamming Lower Bounds via Better Round Elimination.- Propagation Connectivity of Random Hypergraphs.- Improved Pseudorandom Generators for Depth 2 Circuits.- The Structure of Winning Strategies in Parallel Repetition Games.- Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries.- Periodicity in Streams.- Rumor Spreading on Random Regular Graphs and Expanders.- On Testing Computability by Small Width OBDDs.- Learning and Lower Bounds for AC 0 with Threshold Gates.- Liftings of Tree-Structured Markov Chains.- Constructive Proofs of Concentration Bounds.- Almost-Euclidean Subspaces of via Tensor Products: A Simple Approach to Randomness Reduction.- Testing Outerplanarity of Bounded Degree Graphs.- Two-Source Extractors Secure against Quantum Adversaries.- Locally Testable vs. Locally Decodable Codes.- Differential Privacy and the Fat-Shattering Dimension of Linear Queries.- Two Theorems on List Decoding.- Delaying Satisfiability for Random 2SAT.- Improved Rounding for Parallel Repeated Unique Games.- A Query Efficient Non-adaptive Long Code Test with Perfect Completeness.- Relativized Worlds without Worst-Case to Average-Case Reductions for NP.- A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field.

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9783540380443 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Josep Diaz; Klaus Jansen; José D.P. Rolim; Uri Zwick)


< zum Archiv...