Над 4 милиона заглавия на английски и други езици! Открийте новата си история още днес! Безплатна доставка за поръчки над 69.99€

Проверка на състоянието на поръчката

Станете част от общност от любители на книгите от цял свят и получавате много предимства. Създай на безплатен акаунт

Безплатна доставка със Еконт над 69.99 €

Куриер Speedy 3.49 € Пункт на Speedy 3.49 € ЕКОНТ 3.99 € Еконтомат/Офис на Еконт 3.99 € Ekont Box 3.99 € Sameday 3.99 € Sameday box 3.99 € Box Now 3.99 €

Контакт

Как се пазарува?

Помощ

Моят акаунт

▸ Празна :-(

Programming in Networks and Graphs

Name: Programming in Networks and Graphs
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 02172552
Price: 54.3 EUR
Availability: InStock
Author: Ulrich Derigs
ISBN: 9783540189695

On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms

Ulrich Derigs

Език

Английски език

Книга С меки корици

Код Либристо: 02172552

Издателство Springer-Verlag Berlin and Heidelberg GmbH & Co. KG

Network flow and matching are often treated separately in the literature and for each class a variet... Цялото описание

Код Либристо: 02172552

132 b

54.30 €

106.21 лв

Външен склад Изпращаме след 5-8 дни

30 дни за връщане на стоката

Клиентите са закупили също

Biblia. Wielkie opowieści Starego Testamentu wyd. 2023 Frédéric Boyer

С твърди корици

35.62 € 69.66 лв

pharmazeutische Markt in Europa - Patentmissbrauch als Wettbewerbsbehinderung von Generika Sven Stelzner

С меки корици

45.22 € 88.44 лв

Garder le cap SEMPE

С меки корици

12.59 € 24.63 лв

Accessoires de précision Virag Srivastava

С меки корици

51.72 € 101.16 лв

La twittérature - Les chefs-d'oeuvre de la littérature revus par la génération twitter Emmett Rensin

С меки корици

18.12 € 35.43 лв

Let's play, Mom! (Hindi Edition) Kidkiddos Books

С меки корици

16.51 € 32.30 лв

Operación Entebbe: La Historia Y El Legado De la Más Famosa Operación Rescate De Israel Charles River Editors

С меки корици

11.35 € 22.20 лв

Ravensburger Kinderpuzzle - 03007 Alle meine Farben - my first color puzzle mit 6x4 Teilen - Puzzle für Kinder ab 2 Jahren

Игра

13.06 € 25.54 лв

Kartenaufnahme, Netzentwurfe, Gestaltungsmerkmale, topographische Karten Viktor Heissler

С твърди корици

125.19 € 244.84 лв

Cuentos Infantiles Tradicionales: Compilacion Hermanos Grimm

С меки корици

12.64 € 24.73 лв

Etudes Sur Le Vagabondage: Memoire Lu A l'Academie Des Sciences Morales Et Politiques Homberg-T

С меки корици

24.16 € 47.24 лв

Ultimate Collection Eurythmics

Аудио компактдиск

16.41 € 32.10 лв

Network flow and matching are often treated separately in the literature and for each class a variety of different algorithms has been developed. These algorithms are usually classified as primal, dual, primal-dual etc. The question the author addresses in this work is that of the existence of a common combinatorial principle which might be inherent in all those apparently different approaches. It is shown that all common network flow and matching algorithms implicitly follow the so-called shortest augmenting path. This can be interpreted as a greedy-like decision rule where the optimal solution is built up through a sequence of local optimal solutions. The efficiency of this approach is realized by combining this myopic decision rule with an anticipant organization. The approach of this work is organized as follows. For several standard flow and matching problems the common solution procedures are first reviewed. It is then shown that they all reduce to a common basic principle, that is, they all perform the same computational steps if certain conditions are set properly and ties are broken according to a common rule. Recognizing this near-equivalence of all commonly used algorithms the question of the best method has to be modified - all methods are (only) different implementations of the same algorithm obtained by different views of the problem.