Home
»
Approximative Algorithmen und Nichtapproximierbarkeit
Approximative Algorithmen und Nichtapproximierbarkeit
Regular price
€56.99
603 verified reviews
100% verified
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
14-28 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Close
A01=Klaus Jansen
A01=Marian Margraf
Approximationstheorie
Author_Klaus Jansen
Author_Marian Margraf
Category=UMB
Computational Complexity
Discrete Optimization
Diskrete Optimierung
Efficient Algorithms
Effizienter Algorithmus
eq_bestseller
eq_computing
eq_isMigrated=1
eq_nobargain
eq_non-fiction
Graph Theory
Graphentheorie
Komplexitatstheorie
Linear Programming
Product details
- ISBN 9783110203165
- Weight: 1021g
- Dimensions: 170 x 244mm
- Publication Date: 15 Apr 2008
- Publisher: De Gruyter
- Publication City/Country: DE
- Product Form: Hardback
Approximative Algorithmen und Nichtapproximierbarkeit
€56.99
