Description: Approximation Algorithms for Combinatorial Optimization by Klaus Jansen, Jose Rolim Estimated delivery 3-12 business days Format Paperback Condition Brand New Description A volume of 17 papers from a workshop on approximation algorithms for combinatorial optimization. They address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, scheduling problems, and applications. Publisher Description This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX98, held in conjunction with ICALP98 in Aalborg, Denmark, in July 1998.The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications. Details ISBN 3540647368 ISBN-13 9783540647362 Title Approximation Algorithms for Combinatorial Optimization Author Klaus Jansen, Jose Rolim Format Paperback Year 1998 Pages 207 Edition 1998th Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG GE_Item_ID:151401837; About Us Grand Eagle Retail is the ideal place for all your shopping needs! With fast shipping, low prices, friendly service and over 1,000,000 in stock items - you're bound to find what you want, at a price you'll love! Shipping & Delivery Times Shipping is FREE to any address in USA. Please view eBay estimated delivery times at the top of the listing. Deliveries are made by either USPS or Courier. We are unable to deliver faster than stated. International deliveries will take 1-6 weeks. NOTE: We are unable to offer combined shipping for multiple items purchased. This is because our items are shipped from different locations. Returns If you wish to return an item, please consult our Returns Policy as below: Please contact Customer Services and request "Return Authorisation" before you send your item back to us. Unauthorised returns will not be accepted. Returns must be postmarked within 4 business days of authorisation and must be in resellable condition. Returns are shipped at the customer's risk. We cannot take responsibility for items which are lost or damaged in transit. For purchases where a shipping charge was paid, there will be no refund of the original shipping charge. Additional Questions If you have any questions please feel free to Contact Us. Categories Baby Books Electronics Fashion Games Health & Beauty Home, Garden & Pets Movies Music Sports & Outdoors Toys
Price: 66.18 USD
Location: Fairfield, Ohio
End Time: 2024-11-21T03:38:16.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
ISBN-13: 9783540647362
Book Title: Approximation Algorithms for Combinatorial Optimization
Number of Pages: IX, 207 Pages
Publication Name: Approximation Algorithms for Combinatorial Optimization : Proceedings of the International ICALP'98, Workshop, APPROX'98, Aalborg, Denmark, July 18-19, 1998
Language: English
Publisher: Springer Berlin / Heidelberg
Subject: Programming / Algorithms, Functional Analysis, Computer Science, Combinatorics, Discrete Mathematics
Publication Year: 1998
Type: Textbook
Item Weight: 24.3 Oz
Subject Area: Mathematics, Computers
Item Length: 9.3 in
Author: Jose Rolim
Series: Lecture Notes in Computer Science Ser.
Item Width: 6.1 in
Format: Trade Paperback
