Jetzt 20% Rabatt auf alle English Books. Jetzt in über 4 Millionen Büchern stöbern und profitieren!
Willkommen, schön sind Sie da!
Logo Ex Libris

Randomization and Approximation Techniques in Computer Science

  • Kartonierter Einband
  • 396 Seiten
(0) Erste Bewertung abgeben
Bewertungen
(0)
(0)
(0)
(0)
(0)
Alle Bewertungen ansehen
InhaltInvited Paper.- Disjoint Paths in Expander Graphs via Random Walks: a Short Survey.- Regular Papers.- A Derandomization Usin... Weiterlesen
20%
115.00 CHF 92.00
Sie sparen CHF 23.00
Print on Demand - Auslieferung erfolgt in der Regel innert 4 bis 6 Wochen.
Bestellung & Lieferung in eine Filiale möglich

Beschreibung

Inhalt
Invited Paper.- Disjoint Paths in Expander Graphs via Random Walks: a Short Survey.- Regular Papers.- A Derandomization Using Min-Wise Independent Permutations.- An Algorithmic Embedding of Graphs via Perfect Matchings.- Deterministic Hypergraph Coloring and Its Applications.- On the Derandomization of Space-Bounded Computations.- Talagrand's Inequality and Locality in Distributed Computing.- On-line Bin-Stretching.- Combinatorial Linear Programming: Geometry Can Help.- A Note on Bounding the Mixing Time by Linear Programming.- Robotic Exploration, Brownian Motion and Electrical Resistance.- Fringe analysis of synchronized parallel algorithms on 23 trees.- On Balls and Bins with Deletions.- Balls into Bins A Simple and Tight Analysis.- Invited Paper.- Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs.- Regular Papers.- Using Approximation Hardness to Achieve Dependable Computation.- Complexity of Sequential Pattern Matching Algorithms.- A Random Server Model for Private Information Retrieval.- Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).- Randomized Lower Bounds for Online Path Coloring.- Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem.- On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem.- A High Performance Approximate Algorithm for the Steiner Problem in Graphs.- Invited Paper.- Random Geometric Problems on [0, 1]2.- Regular Papers.- A Role of Constraint in Self-Organization.- Constructive Bounds and Exact Expectations for the Random Assignment Problem.- The Burnside Process Converges Slowly.- Quicksort Again Revisited.- Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems.- Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow.

Produktinformationen

Titel: Randomization and Approximation Techniques in Computer Science
Untertitel: Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998 Proceedings
Editor:
EAN: 9783540651420
ISBN: 354065142X
Format: Kartonierter Einband
Herausgeber: Springer Berlin Heidelberg
Anzahl Seiten: 396
Gewicht: 598g
Größe: H235mm x B155mm x T21mm
Jahr: 1998
Untertitel: Englisch
Auflage: 1998

Weitere Produkte aus der Reihe "Lecture Notes in Computer Science"