Enter your search into one or more of the boxes below:
You can refine your search by selecting from any of the options below:
Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings
Foyalty 191

Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings (Paperback)

Printed to order. Despatched in 2-3 weeks.
Email me when back in stock


The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e?cient approximate solutions to computationally d- ?cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the ?eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc .. ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ?ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications.

The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R.

Computing & ITComputer programming / software developmentAlgorithms & data structuresComputing & ITComputer scienceMathematical theory of computationScience & MathematicsMathematicsOptimization Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Publication Date: 02/09/2002 ISBN-13: 9783540441861  Details: Type: Paperback Format: Books
Availability: Printed to order. Despatched in 2-3 weeks.  

More books by Klaus Jansen

More books by Stefano Leonardi

More books by Vijay V. Vazirani

Leave Review


Delivery Options

All delivery times quoted are the average, and cannot be guaranteed. These should be added to the availability message time, to determine when the goods will arrive. During checkout we will give you a cumulative estimated date for delivery.

Location 1st Book Each additional book Average Delivery Time
UK Standard Delivery FREE FREE 3-5 Days
UK First Class £4.50 £1.00 1-2 Days
UK Courier £7.00 £1.00 1-2 Days
Western Europe** Courier £17.00 £3.00 2-3 Days
Western Europe** Airmail £5.00 £1.50 4-14 Days
USA / Canada Courier £20.00 £3.00 2-4 Days
USA / Canada Airmail £7.00 £3.00 4-14 Days
Rest of World Courier £22.50 £3.00 3-6 Days
Rest of World Airmail £8.00 £3.00 7-21 Days

** Includes Austria, Belgium, Denmark, France, Germany, Greece, Iceland, Irish Republic, Italy, Luxembourg, Netherlands, Portugal, Spain, Sweden and Switzerland.

Delivery Help & FAQs

Returns Information

If you are not completely satisfied with your purchase*, you may return it to us in its original condition with in 30 days of receiving your delivery or collection notification email for a refund. Except for damaged items or delivery issues the cost of return postage is borne by the buyer. Your statutory rights are not affected.

* For Exclusions and terms on damaged or delivery issues see Returns Help & FAQs

You might also like

Algorithmics of Nonuniformity: Tools...
Micha Hofri; Hosam Mahmoud
Handbook of Approximation Algorithms...
Teofilo F. Gonzalez
Pro Machine Learning Algorithms: A...
V Kishore Ayyadevara
Introduction to Diagnosis of Active...
Gianfranco Lamperti; Marina Zanella;...
© W&G Foyle Ltd
Foyles uses cookies to help ensure your experience on our site is the best possible. Click here if you’d like to find out more about the types of cookies we use.
Accept and Close