Approximation algorithms

Approximation algorithms

Enregistré dans:
Détails bibliographiques
Auteur principal : Vazirani Vijay V. (Auteur)
Format : Livre
Langue : anglais
Titre complet : Approximation algorithms / Vijay V. Vazirani
Publié : Berlin, New York, Paris [etc.] : Springer , copyright 2001
Description matérielle : 1 vol. (XIX-380 p.)
Sujets :
Algorithmes
Algorithmes d'approximation
Optimisation mathématique
Approximation, Théorie de l'
  • I. Combinatorial Algorithms
  • 2. Set cover
  • 3. Steiner Tree and TSP
  • 4. Multiway Cut and k-Cut
  • 5. k-center
  • 6. Feedback Vertex Set
  • 7. Shortest Superstring
  • 8. Knapsack
  • 9. Bin Packing
  • 10. Minimum Makespan Scheduling
  • 11. Euclidean TSP
  • II. LP-Based Algorithms
  • 12. Introduction to LP-Duality
  • 13. Set Cover via Dual Fitting
  • 14. Rounding Applied to Set Cover
  • 15. Set Cover via the Primal-Dual Schema
  • 16. Maximum Satisfiability
  • 17. Scheduling on Unrelated Parallel Machines
  • 18. Multicut and Integer Multicommodity Flow in Trees
  • 19. Multiway Cut
  • 20. Multicut in General Graphs
  • 21. Sparsest Cut
  • 22. Steiner Forest
  • 23. Steiner Network
  • 24. Facility Location
  • 25. k-Median
  • 26. Semidefinite Programming
  • III. Others Topics
  • 27. Shortest Vector
  • 28. Counting Problems
  • 29. Hardness of Approximation
  • 30. Open Problems