Approximation Algorithms For Combinatorial Optimization

Third International Workshop, Approx 2000, Saarbreucken, Germany, September 5-8, 2000, Proceedings

Editor: KlausJansen

Springer-Verlag Berlin And Heidelberg Gmbh & Co. Kg (Germany), 2000
Paperback, 284 pages
Size: 235x155 mm
ISBN: 9783540679967
ISBN-10: 3540679960

Our price: £34.99

Usually ships within 1 week.

Will be shipped from: United Kingdom
 Add to Shopping Basket 

Approximation Algorithms For Combinatorial Optimization

The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, randomization techniques, average-case analysis, scheduling problems, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.

Related links:

Klaus Jansen
Springer-Verlag Berlin And Heidelberg Gmbh & Co. Kg

More information from Wikipedia:

Klaus Jansen
© 2006-2009 Eruditor Ltd and its partners

Search

Whole catalogue
Freedom of information & freedom of speech

Advanced Search

Browse

Authors’ Name Index

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Share |