|
Showing 1 - 3 of
3 matches in All Departments
This book constitutes the refereed proceedings of the 10th
International Conference on Theory and Applications of Models of
Computation, TAMC 2013, held in Hong Kong, China, in May 2013. The
31 revised full papers presented were carefully reviewed and
selected from 70 submissions. Bringing together a wide range of
researchers with interests in computational theory and
applications, the papers address the three main themes of the
conference which were computability, complexity, and algorithms and
present current research in these fields with aspects to
theoretical computer science, algorithmic mathematics, and
applications to the physical sciences.
|
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques - 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings (Paperback, 2005 ed.)
Chandra Chekuri, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan
|
R1,794
Discovery Miles 17 940
|
Ships in 10 - 15 working days
|
This volume contains the papers presented at the 8th International
Workshop on Approximation Algorithms for Combinatorial Optimization
Problems (APPROX 2005) and the 9th International Workshop on
Randomization and Computation(RANDOM2005),
whichtookplaceconcurrentlyattheUniversity of California in
Berkeley, on August 22-24, 2005. APPROX focuses on algori- mic and
complexity issues surrounding the development of e?cient
approximate solutions to computationally hard problems, and APPROX
2005 was the eighth in the series after Aalborg (1998), Berkeley
(1999), Saarbru ]cken (2000), Ber- ley (2001), Rome (2002),
Princeton(2003), and Cambridge(2004).RANDOM is concerned with
applications of randomness to computational and combinatorial
problems, and RANDOM 2005 was the ninth workshop in the series
foll- ing Bologna (1997), Barcelona (1998), Berkeley(1999), Geneva
(2000), Berkeley (2001), Harvard (2002), Princeton (2003), and
Cambridge (2004). Topics of interest for APPROX and RANDOM are:
design and analysis of approximation algorithms, hardness of
approximation, small space and data streaming algorithms,
sub-linear time algorithms, embeddings and metric space methods,
mathematical programming methods, coloring and partitioning, cuts
and connectivity, geometric problems, game theory and applications,
network designandrouting, packingand covering, scheduling,
designandanalysisofr- domized algorithms, randomized complexity
theory, pseudorandomness and - randomization, random
combinatorialstructures, randomwalks/Markovchains, expander graphs
and randomness extractors, probabilistic proof systems, r- dom
projections and embeddings, error-correcting codes, average-case
analysis, property testing, computational learning theory, and
other applications of - proximation and randomness. The volume
contains 20 contributed papers selected by the APPROX P- gram
Committee out of 50 submissions, and 21 contributed papers selected
by the RANDOM Program Committee out of 51 submis
|
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001 (Paperback, 2001 ed.)
Michel Goemans, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan
|
R1,666
Discovery Miles 16 660
|
Ships in 10 - 15 working days
|
This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.
|
You may like...
Celebrations
Jan Kohler
Hardcover
R450
R351
Discovery Miles 3 510
The Expendables 2
Sylvester Stallone, Jason Statham, …
Blu-ray disc
(1)
R64
Discovery Miles 640
|