Design and Analysis of Approximation AlgorithmsDing-Zhu Du
Design and Analysis of Approximation Algorithms
Ding-Zhu Du, Ker-I Ko, Xiaodong Hu · 2011
Where to buy
Amazon’s price changes daily, so the most accurate place to see it is there, at the moment you buy.
View on AmazonThis is an affiliate link: if you buy through it, the site earns a small commission at no extra cost to you, which helps us bring quality content and maintain the site. As an Amazon Associate we earn from qualifying purchases.
Book details
- Year
- 2011
- Publisher
- Springer
- Editions
- 2
- Pages
- 454
- ISBN
- 9781461417026
Data source: Wikidata
More by Ding-Zhu Du
Advances in Steiner TreesDing-Zhu Du
Advances in Steiner Trees
Ding-Zhu Du · 2013
Connected Dominating Set: Theory and ApplicationsDing-Zhu Du
Connected Dominating Set: Theory and Applications
Ding-Zhu Du · 2013
Connected Dominating Set Theory And ApplicationsDing-Zhu Du
Connected Dominating Set Theory And Applications
Ding-Zhu Du · 2012
Theory of computational complexityDing-Zhu Du
Theory of computational complexity
Ding-Zhu Du · 2000
Computing and combinatoricsDing-Zhu Du
Computing and combinatorics
Ding-Zhu Du · 2000
Combinatorial Network TheoryDing-Zhu Du
Combinatorial Network Theory
Ding-Zhu Du · 1996
Nonlinear Combinatorial OptimizationDing-Zhu Du
Nonlinear Combinatorial Optimization
Ding-Zhu Du · 2020
Connected Dominating SetDing-Zhu Du
Connected Dominating Set
Ding-Zhu Du · 2014
Combinatorial group testing and its applicationsDing-Zhu Du
Combinatorial group testing and its applications
Ding-Zhu Du · 2000
Network Optimization ProblemsDing-Zhu Du
Network Optimization Problems
Ding-Zhu Du · 1993