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...
Κύριοι συγγραφείς: | Du, Ding-Zhu (Συγγραφέας), Ko, Ker-I (Συγγραφέας), Hu, Xiaodong (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
New York, NY :
Springer New York,
2012.
|
Σειρά: | Springer Optimization and Its Applications,
62 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Numerical Optimization Theoretical and Practical Aspects /
ανά: Bonnans, J. Frédéric, κ.ά.
Έκδοση: (2006) -
Bioinspired Computation in Combinatorial Optimization Algorithms and Their Computational Complexity /
ανά: Neumann, Frank, κ.ά.
Έκδοση: (2010) -
Mathematical Aspects of Network Routing Optimization
ανά: Oliveira, Carlos A.S, κ.ά.
Έκδοση: (2011) -
Approximation Algorithms and Semidefinite Programming
ανά: Gärtner, Bernd, κ.ά.
Έκδοση: (2012) -
Evolutionary Computation in Combinatorial Optimization 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings /
Έκδοση: (2004)