Design and Analysis of Approximation Algorithms
When precise algorithmic solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a textbook for a graduate course in theoretical computer science taught globally in universities. It can also be used as a reference work for...
| Main Authors: | Du, Ding-Zhu (Author), Ko, Ker-I (Author), Hu, Xiaodong (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York, NY :
Springer New York,
2012.
|
| Series: | Springer Optimization and Its Applications,
62 |
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Numerical Optimization Theoretical and Practical Aspects /
by: Bonnans, J. Frédéric, et al.
Published: (2006) -
Bioinspired Computation in Combinatorial Optimization Algorithms and Their Computational Complexity /
by: Neumann, Frank, et al.
Published: (2010) -
Approximation Algorithms and Semidefinite Programming
by: Gärtner, Bernd, et al.
Published: (2012) -
Mathematical Aspects of Network Routing Optimization
by: Oliveira, Carlos A.S, et al.
Published: (2011) -
Evolutionary Computation in Combinatorial Optimization 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings /
Published: (2004)