Contatto
Come acquistare
Consegna
Guida all'acquisto
Programming in Networks and Graphs
On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms
Inglese
141 b
30 giorni per il reso
I clienti hanno acquistato anche
/
In brossura
44.79
€
/
In brossura
17.89
€
/
In brossura
11.79
€
/
Rigido
145.89
€
/
In brossura
25.09
€
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.
Informazioni sul libro
Inglese
Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatarioPotrebbe interessarti anche
/
In brossura
9.39
€
/
In brossura
7.99
€
/
In brossura
23.99
€
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?