This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jer…
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
Combinatorial image analysis: 14th international workshop, IWCIA 2011, Madrid, …
by Barneva, Reneta P., Brimkov, Valentin E., Aggarwal, Jake K., Koroutchev, Kostadin N., Korutcheva, Elka R., IWCIA, Madrid, International Workshop on Combinatorial Image Analysis, Madrid)
fromLecture Notes in Computer Science
Computing and combinatorics: 17th annual international conference, COCOON 2011…
by Du, Ding-Zhu, Fu, Bin, COCOON, Dallas, Tex, Annual International Computing and Combinatorics Conference, Dallas, Tex.), COCOON, Dallas, Tex.), International Computing and Combinatorics Conference, Dallas, Tex.)
fromLecture Notes in Computer Science
The Euclidean shortest path (ESP) problem asks the question: what is the path of minimum length connecting two points in a 2- or 3-dimensional space? Variants of this industrially-significant computational geometry problem also require the path to pass through specified areas an…
Thirty years ago, mathematical computation was difficult to perform and thus used sparingly. However, mathematical computation has become far more accessible due to the emergence of the personal computer, the discovery of fiber-optics and the consequent development of the modern…