Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques: Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,Berkeley, CA, USA, August 8-11, 1999 Pro - Lecture Notes in Computer Science 1671 (Paperback)
  • Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques: Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,Berkeley, CA, USA, August 8-11, 1999 Pro - Lecture Notes in Computer Science 1671 (Paperback)
zoom

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques: Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,Berkeley, CA, USA, August 8-11, 1999 Pro - Lecture Notes in Computer Science 1671 (Paperback)

(editor), (editor), (editor), (editor)
£59.99
Paperback 298 Pages / Published: 28/07/1999
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
This volume contains the papers presented at the3rd International Wo- shoponRandomizationandApproximationTechniquesinComputer Science (RANDOM'99) and the 2nd International Workshop on - proximation Algorithms for Combinatorial Optimization Problems (APPROX'99), which took place concurrently at the University of California, Berkeley, from August 8-11, 1999. RANDOM'99 is concerned with appli- tions of randomness to computational and combinatorial problems, and is the third workshop in the series following Bologna (1997) and Barcelona (1998). APPROX'99 focuses on algorithmic and complexity issues surrounding the - velopment of e?cient approximate solutions to computationally hard problems, and is the second in the series after Aalborg (1998). The volume contains 24 contributed papers, selected by the two program committees from 44 submissions received in response to the call for papers, together with abstracts of invited lectures by Uri Feige (Weizmann Institute), Christos Papadimitriou (UC Berkeley), Madhu Sudan (MIT), and Avi Wigd- son (Hebrew University and IAS Princeton). We would like to thank all of the authors who submitted papers, our invited speakers, the external referees we consulted and the members of the program committees, who were: RANDOM'99 APPROX'99 Alistair Sinclair, UC Berkeley Dorit Hochbaum, UC Berkeley Noga Alon, Tel Aviv U. Sanjeev Arora, Princeton U. Jennifer Chayes, Microsoft Leslie Hall, Johns Hopkins U. Monika Henzinger, Compaq-SRC Samir Khuller, U. of Maryland Mark Jerrum, U. of Edinburgh Phil Klein, Brown U.

Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN: 9783540663294
Number of pages: 298
Weight: 960 g
Dimensions: 235 x 155 x 16 mm
Edition: 1999 ed.

You may also be interested in...

Algorithms Unlocked
Added to basket
Understanding Cryptography
Added to basket
Purely Functional Data Structures
Added to basket
Machine Learning
Added to basket
£39.99
Paperback
Introduction to Algorithms
Added to basket
The End of Error
Added to basket
Gynaecology: Evidence-Based Algorithms
Added to basket
Understanding Cryptography
Added to basket
Algorithms
Added to basket
£66.49
Hardback
Concise Guide to Databases
Added to basket
Generative Art
Added to basket
£25.99
Paperback

Reviews

Please sign in to write a review

Your review has been submitted successfully.