К содержанию
РецензированоEN2005

Graphs, Networks and Algorithms

Dieter Jungnickel

Учебная литература · 2005

Аннотация

The present book focuses mainly on that part of combinatorial optimization which can be formulated and treated by graph theoretical methods; neither the theory of linear programming nor polyhedral combinatorics are considered. Simultaneously, the book gives an introduction into graph theory, where we restrict ourselves to finite graphs. Also, we use an algorithmic point of view; that is, we are not content with knowing that an optimal solution exists (this is trivial to see in most cases anyway), but we are mainly interested in the problem of how to find an optimal (or at least almost optimal) solution as efficiently as possible. Most of the problems we treat have a good algorithmic solution, but we also show how even difficult problems can be treated (for example by approximation algorithms or complete enumeration) using a particular hard problem namely the famous travelling salesman problemas an example

Доказательный фрагмент

«The present book focuses mainly on that part of combinatorial optimization which can be formulated and treated by graph theoretical methods; neither the theory of linear programming nor polyhedral combinatorics are co…»

Образец извлечения

Демо-превью

The present book focuses mainly on that part of combinatorial optimization which can be formulated and treated by graph theoretical methods; neither the theory of linear programming nor polyhedral combinatorics are co… Полный текст публикации CiteX не хранит — доступ к первоисточнику открывается по DOI согласно лицензии издателя и выбранному плану.

DOI не указан
Цитирований
0
Тип
Журнал
Страна
Узбекистан
Спросить CiteX об этой работе

Смежные источники