Marknadens största urval
Fri frakt över 199 kr
Snabb leverans
Hjälp
Logga in
  1. Hem
  2. Böcker
  3. Företagande & lärande
  4. Data & IT
  5. Approximation Algorithms for Traveling Salesman Problems

Approximation Algorithms for Traveling Salesman Problems

av Vera (University of Bonn) Traub
Approximation Algorithms for Traveling Salesman Problems av Vera (University of Bonn) Traub
Om Approximation Algorithms for Traveling Salesman Problems

This is the first book on approximation algorithms for the Traveling Salesman Problem, a central topic in discrete mathematics, theoretical computer science, and combinatorial optimization. It presents the state of the art comprehensively as well as advances it, making it an excellent resource for teaching, self-study, and further research.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9781009445412
  • Format:
  • Inbunden
  • Sidor:
  • 444
  • Utgiven:
  • 5. december 2024
  • Mått:
  • 160x235x30 mm.
  • Vikt:
  • 768 g.
  I lager
Leveranstid: 4-7 vardagar
Förväntad leverans: 1. april 2025

Om Vera (University of Bonn) Traub

Se alla böcker av Vera (University of Bonn) Traub

Beskrivning av Approximation Algorithms for Traveling Salesman Problems

This is the first book on approximation algorithms for the Traveling Salesman Problem, a central topic in discrete mathematics, theoretical computer science, and combinatorial optimization. It presents the state of the art comprehensively as well as advances it, making it an excellent resource for teaching, self-study, and further research.

Användarnas betyg av Approximation Algorithms for Traveling Salesman Problems



Andra köpte även...
Hitta liknande böcker
Boken Approximation Algorithms for Traveling Salesman Problems finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.