Description: Randomization and Approximation Techniques in Computer Science by Jose Rolim This book constitutes the refereed proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM97, held as a satelite meeting of ICALP97, in Bologna, Italy, in July 1997.The volume presents 14 thoroughly revised full papers selected from 37 submissions; FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description This book constitutes the refereed proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM97, held as a satelite meeting of ICALP97, in Bologna, Italy, in July 1997.The volume presents 14 thoroughly revised full papers selected from 37 submissions; also included are four invited contributions by leading researchers. The book focuses on algorithms and complexity aspects arising in the development of efficient randomized solutions to computationally difficult problems. The papers are organized in sections on approximation, randomness, algorithms, and complexity. Notes Springer Book Archives Table of Contents Polynomial time approximation schemes for some dense instances of NP-hard optimization problems.- Average-case complexity of shortest-paths problems in the vertex-potential model.- Approximation algorithms for covering polygons with squares and similar problems.- Greedily approximating the r-independent set and k-center problems on random instances.- Nearly linear time approximation schemes for Euclidean TSP and other geometric problems.- Random sampling of Euler tours.- A combinatorial consistency lemma with application to proving the PCP theorem.- Super-bits, demi-bits, and NP/qpoly-natural proofs.- Sample spaces with small bias on neighborhoods and error-correcting communication protocols.- Approximation on the web: A compendium of NP optimization problems.- Random-based scheduling new approximations and LP lower bounds.- Go with the winners generators with applications to molecular modeling.- Probabilistic approximation of some NP optimization problems by finite-state machines.- Using hard problems to derandomize algorithms: An incomplete survey.- Weak and strong recognition by 2-way randomized automata.- Tally languages accepted by Monte Carlo pushdown automata.- Resource-bounded randomness and compressibility with respect to nonuniform measures.- Randomness, stochasticity and approximations. Promotional Springer Book Archives Details ISBN3540632484 Short Title RANDOMIZATION & APPROXIMATION Series Lecture Notes in Computer Science Language English ISBN-10 3540632484 ISBN-13 9783540632481 Media Book Format Paperback Series Number 1269 Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K Place of Publication Berlin Country of Publication Germany Author Jose Rolim Pages 236 Subtitle International Workshop RANDOM97, Bologna, Italy, July 11-12, 1997 Proceedings Illustrations VIII, 236 p. DOI 10.1007/b60068;10.1007/978-3-540-69247-8;10.1007/3-540-63248-4 Edited by Jose Rolim Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Year 1997 Publication Date 1997-06-25 DEWEY 004.015114 Audience Postgraduate, Research & Scholarly Edition Description 1997 ed. Edition 1997th We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:158859447;
Price: 131.77 AUD
Location: Melbourne
End Time: 2024-11-05T05:30:18.000Z
Shipping Cost: 0 AUD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
Return policy details:
ISBN-13: 9783540632481
Book Title: Randomization and Approximation Techniques in Computer Science
Number of Pages: 236 Pages
Language: English
Publication Name: Randomization and Approximation Techniques in Computer Science: International Workshop RANDOM'97, Bologna, Italy, July 11-12, 1997 Proceedings
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Publication Year: 1997
Subject: Computer Science, Mathematics
Item Height: 235 mm
Item Weight: 770 g
Type: Textbook
Author: Jose Rolim
Item Width: 155 mm
Format: Paperback
