Approximation Algorithms for Combinatorial Optimization: International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings (Lecture Notes in Computer Science, 1444)
Language: English
Published by Springer, 1998
- Softcover
- Used
Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.-OnTimeBooks-
5-star seller
AbeBooks seller since March 9, 2023
Softcover
Condition: Used - Very good
US$ 43.69
Free Shipping
Ships within U.S.A.
Quantity: 1 available
Add to basketFree 30-day returns
Item description from seller
Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail.
Seller Inventory # OTV.3540647368.VG
- Title
- Approximation Algorithms for Combinatorial Optimization: International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings (Lecture Notes in Computer Science, 1444)
- Publisher
- Springer
- Publication year
- 1998
- Condition
- very_good
- Binding
- Soft cover
- Language
- English
- ISBN 10
- 3540647368
- ISBN 13
- 9783540647362
This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 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.
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.
"Synopsis" may belong to another edition of this title.
-OnTimeBooks-
Phoenix, AZ, U.S.A.
5-star seller
AbeBooks seller since March 9, 2023
Shipping rates within U.S.A.
| Item | 3 to 8 business days | 2 to 6 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 3.99 |
Payment methods
Specialty
Used books of all typesSeller's business information
BookDrop LLC
601 S 54th Ave, STE 101
Phoenix, AZ U.S.A. 85043