Randomization and approximation techniques in computer science: second international workshop, RANDOM '98, Barcel…
by International Workshop on Randomization and Approximation Techniques in Computer Science, Barcelona, Spain), Luby, Michael George, Rolim, José D. P., Serna, Maria
fromLecture Notes in Computer Science
Randomization and approximation techniques in computer science: second international workshop, RANDOM '98, Barcel…
by LINK (Online service), International Workshop on Randomization and Approximation Techniques in Computer Science, Barcelona, Spain), Luby, Michael George, Rolim, José D. P., Serna, Maria
fromLecture Notes in Computer Science
This book constitutes the refereed proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'98, held in Barcelona, Spain, in October 1998. The 26 revised full papers presented were carefully reviewed and selected …
Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterpart…
Approximation, randomization, and combinatorial optimization: algorithms and techniques ; 14th international wo…
by Goldberg, Leslie Ann, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Princeton, N.J.), International Workshop on Randomization and Computation, Princeton, N.J.), APPROX, Princeton, NJ, RANDOM, Princeton, NJ
fromLecture Notes in Computer Science
Approximation, randomization, and combinatorial optimization: algorithms and techniques ; 14th international wo…
by Ravi, R., Goldberg, Leslie Ann, Rolim, José D. P., International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Princeton, N.J.), International Workshop on Randomization and Computation, Princeton, N.J.), Jansen, Klaus, APPROX, Princeton, NJ, RANDOM, Princeton, NJ
fromLecture Notes in Computer Science
"Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of…
Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of …