Verwandte Artikel zu Approximation, Randomization and Combinatorial Optimization....

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 7th International Workshop on Approximation Algorithms for ... Workshop on Randomization and Comput - Softcover

 
9783662207291: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 7th International Workshop on Approximation Algorithms for ... Workshop on Randomization and Comput

Inhaltsangabe

Contributed Talks of APPROX.- Designing Networks with Existing Traffic to Support Fast Restoration.- Simultaneous Source Location.- Computationally-Feasible Truthful Auctions for Convex Bundles.- Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks.- On the Crossing Spanning Tree Problem.- A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One.- Maximum Coverage Problem with Group Budget Constraints and Applications.- The Greedy Algorithm for the Minimum Common String Partition Problem.- Approximating Additive Distortion of Embeddings into Line Metrics.- Polylogarithmic Inapproximability of the Radio Broadcast Problem.- On Systems of Linear Equations with Two Variables per Equation.- An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case.- Cost-Sharing Mechanisms for Network Design.- Approximating Max k CSP Using Random Restrictions.- Approximation Schemes for Broadcasting in Heterogenous Networks.- Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks.- Convergence Issues in Competitive Games.- Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem.- Min-Max Multiway Cut.- Contributed Talks of RANDOM.- The Chromatic Number of Random Regular Graphs.- Estimating the Distance to a Monotone Function.- Edge Coloring with Delays.- Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption.- The Sketching Complexity of Pattern Matching.- Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions.- Robust Locally Testable Codes and Products of Codes.- A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes.-Strong Refutation Heuristics for Random k-SAT.- Counting Connected Graphs and Hypergraphs via the Probabilistic Method.- Improved Randomness Extraction from Two Independent Sources.- The Diameter of Randomly Perturbed Digraphs and Some Applications.- Maximum Weight Independent Sets and Matchings in Sparse Random Graphs.- Estimating Frequency Moments of Data Streams Using Random Linear Combinations.- Fooling Parity Tests with Parity Gates.- Distribution-Free Connectivity Testing.- Testing the Independence Number of Hypergraphs.- A Note on Approximate Counting for k-DNF.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

EUR 5,91 für den Versand von Vereinigtes Königreich nach Deutschland

Versandziele, Kosten & Dauer

Weitere beliebte Ausgaben desselben Titels

9783540228943: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 7th International Workshop on Approximation Algorithms for ... 3122 (Lecture Notes in Computer Science)

Vorgestellte Ausgabe

ISBN 10:  3540228942 ISBN 13:  9783540228943
Verlag: Springer, 2008
Softcover

Suchergebnisse für Approximation, Randomization and Combinatorial Optimization....

Beispielbild für diese ISBN

Verlag: Springer, 2014
ISBN 10: 366220729X ISBN 13: 9783662207291
Neu Softcover

Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. In. Artikel-Nr. ria9783662207291_new

Verkäufer kontaktieren

Neu kaufen

EUR 55,77
Währung umrechnen
Versand: EUR 5,91
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb