pickabook books with huge discounts for everyone
pickabook books with huge discounts for everyone
Visit our new collection website www.collectionsforschool.co.uk
     
Email: Subscribe to news & offers:
Need assistance? Log In/Register


Item Details
Title: RANDOMIZATION, APPROXIMATION AND COMBINATORIAL OPTIMIZATION
By: Dorit Hochbaum (Editor), Klaus Jansen (Editor), Jose D. P. Rolim (Editor)
Format: Paperback

List price: £62.99


We currently do not stock this item, please contact the publisher directly for further information.

ISBN 10: 3540663290
ISBN 13: 9783540663294
Publisher: SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG
Pub. date: 28 July, 1999
Edition: 1999 ed.
Series: Lecture Notes in Computer Science v. 1671
Pages: 298
Description: This text presents various new results within the areas covered by the workshop.
Synopsis: 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.
Illustrations: biography
Publication: Germany
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Returns: Returnable
Some other items by this author:
ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS (PB)
ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS (PB)
APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION (PB)
APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION (PB)
APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION (PB)
APPROXIMATION ALGORITHMS FOR N-P HARD PROBLEMS (HB)
APPROXIMATION AND ONLINE ALGORITHMS (PB)
APPROXIMATION AND ONLINE ALGORITHMS (PB)
APPROXIMATION AND ONLINE ALGORITHMS (PB)
APPROXIMATION AND ONLINE ALGORITHMS (PB)
APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION (PB)
APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION - ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION, ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES (PB)
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATIONALGORITHMS AND TECHNIQUES (PB)
APPROXIMATIVE ALGORITHMEN UND NICHTAPPROXIMIERBARKEIT
APPROXIMATIVE ALGORITHMEN UND NICHTAPPROXIMIERBARKEIT (HB)
AUTOMATA, LANGUAGES AND PROGRAMMING (PB)
EFFICIENT APPROXIMATION AND ONLINE ALGORITHMS (PB)
EXPERIMENTAL AND EFFICIENT ALGORITHMS (PB)
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (PB)
PARALLEL ALGORITHMS FOR IRREGULAR PROBLEMS: STATE OF THE ART (HB)
PARALLEL ALGORITHMS FOR IRREGULAR PROBLEMS: STATE OF THE ART (PB)
PARALLEL ALGORITHMS FOR IRREGULARLY STRUCTURED PROBLEMS (PB)
PARALLEL ALGORITHMS FOR IRREGULARLY STRUCTURED PROBLEMS (PB)
PARALLEL AND DISTRIBUTED PROCESSING (PB)
PARALLEL AND DISTRIBUTED PROCESSING (PB)
PARALLEL AND DISTRIBUTED PROCESSING (PB)
RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE (PB)
RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE (PB)
RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE (PB)
RANDOMIZATION METHODS IN ALGORITHM DESIGN (HB)
SOLVING IRREGULARLY STRUCTURED PROBLEMS IN PARALLEL (PB)
THEORETICAL ASPECTS OF DISTRIBUTED COMPUTING IN SENSOR NETWORKS (HB)



Information provided by www.pickabook.co.uk
SHOPPING BASKET
  
Your basket is empty
  Total Items: 0
 






Early Learning
Little Worried Caterpillar (PB) Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
add to basket

Early Learning
add to basket

Picture Book
All the Things We Carry PB What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
add to basket