|
|
|
|
| LEADER |
03001cam a2200673 4500 |
| 001 |
PPN098900307 |
| 003 |
http://www.sudoc.fr/098900307 |
| 005 |
20220407055400.0 |
| 010 |
|
|
|a 978-3-642-08469-0
|b 2010
|b br
|
| 010 |
|
|
|a 3-540-65367-8
|b 2001
|b rel.
|d 47,35 EUR
|
| 020 |
|
|
|a US
|b 201042005
|
| 020 |
|
|
|a GB
|b A1-43407
|
| 035 |
|
|
|a 061546992
|9 sudoc
|
| 035 |
|
|
|a 058527346
|9 sudoc
|
| 035 |
|
|
|a (OCoLC)492416539
|
| 035 |
|
|
|a ocm47097680
|
| 035 |
|
|
|z ocm47674851
|
| 035 |
|
|
|a Evry34132
|
| 073 |
|
1 |
|a 9783642084690
|b 2010
|
| 073 |
|
1 |
|a 9783540653677
|b 2001
|
| 100 |
|
|
|a 20011008d2001 k y0frey0103 ba
|
| 101 |
0 |
|
|a eng
|
| 102 |
|
|
|a DE
|a US
|a FR
|
| 105 |
|
|
|a a a 001yy
|
| 106 |
|
|
|a r
|
| 181 |
|
|
|6 z01
|c txt
|2 rdacontent
|
| 181 |
|
1 |
|6 z01
|a i#
|b xxxe##
|
| 182 |
|
|
|6 z01
|c n
|2 rdamedia
|
| 182 |
|
1 |
|6 z01
|a n
|
| 183 |
|
1 |
|6 z01
|a nga
|2 rdacarrier
|
| 200 |
1 |
|
|a Approximation algorithms
|f Vijay V. Vazirani
|
| 210 |
|
|
|a Berlin
|a New York
|a Paris [etc.]
|c Springer
|d copyright 2001
|
| 215 |
|
|
|a 1 vol. (XIX-380 p.)
|c graph., fig., couv. ill.
|d 24 cm
|
| 305 |
|
|
|a Autres tirages : 2003 (ed. corrigée), 2010
|
| 320 |
|
|
|a Bibliogr. p. [357]-372. Index
|
| 359 |
2 |
|
|b I. Combinatorial Algorithms
|c 2. Set cover
|c 3. Steiner Tree and TSP
|c 4. Multiway Cut and k-Cut
|c 5. k-center
|c 6. Feedback Vertex Set
|c 7. Shortest Superstring
|c 8. Knapsack
|c 9. Bin Packing
|c 10. Minimum Makespan Scheduling
|c 11. Euclidean TSP
|b II. LP-Based Algorithms
|c 12. Introduction to LP-Duality
|c 13. Set Cover via Dual Fitting
|c 14. Rounding Applied to Set Cover
|c 15. Set Cover via the Primal-Dual Schema
|c 16. Maximum Satisfiability
|c 17. Scheduling on Unrelated Parallel Machines
|c 18. Multicut and Integer Multicommodity Flow in Trees
|c 19. Multiway Cut
|c 20. Multicut in General Graphs
|c 21. Sparsest Cut
|c 22. Steiner Forest
|c 23. Steiner Network
|c 24. Facility Location
|c 25. k-Median
|c 26. Semidefinite Programming
|b III. Others Topics
|c 27. Shortest Vector
|c 28. Counting Problems
|c 29. Hardness of Approximation
|c 30. Open Problems
|
| 606 |
|
|
|3 PPN027282171
|a Algorithmes
|2 rameau
|
| 606 |
|
|
|3 PPN158644107
|a Algorithmes d'approximation
|2 rameau
|
| 606 |
|
|
|3 PPN027244067
|a Optimisation mathématique
|2 rameau
|
| 606 |
|
|
|3 PPN027282716
|a Approximation, Théorie de l'
|2 rameau
|
| 676 |
|
|
|a 511.8
|
| 686 |
|
|
|a 68-01
|c 2000
|2 msc
|
| 686 |
|
|
|a 68W05
|c 2000
|2 msc
|
| 686 |
|
|
|a 68Q05
|c 2000
|2 msc
|
| 686 |
|
|
|a 68R05
|c 2000
|2 msc
|
| 686 |
|
|
|a 90C05
|c 2000
|2 msc
|
| 686 |
|
|
|a 05A05
|c 2000
|2 msc
|
| 700 |
|
1 |
|3 PPN058928626
|a Vazirani
|b Vijay V.
|f 1957-....
|4 070
|
| 801 |
|
3 |
|a FR
|b Abes
|c 20190222
|g AFNOR
|h 061546992
|
| 801 |
|
3 |
|a FR
|b Abes
|c 20190222
|g AFNOR
|h 058527346
|
| 801 |
|
1 |
|a US
|b OCLC
|g AACR2
|
| 801 |
|
2 |
|a FR
|b AUROC
|g AFNOR
|
| 801 |
|
0 |
|a FR
|b UVSQ
|g AFNOR
|
| 915 |
|
|
|5 441092208:639542689
|b 22238
|
| 930 |
|
|
|5 441092208:639542689
|b 441092208
|a 68C456
|j u
|
| 979 |
|
|
|a CCFA
|
| 991 |
|
|
|5 441092208:639542689
|a exemplaire créé automatiquement par l'ABES
|
| 997 |
|
|
|a CCFA
|b 22238
|d CMB
|e BAP
|s d
|c 68C456
|
| 998 |
|
|
|a 847980
|
Nantilus
