L�g�res traces d'usure sur la couverture. Salissures sur la tranche. Couverture diff�rente. Edition 1988. Ammareal reverse jusqu'� 15% du prix net de cet article � des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Slight signs of wear on the cover. Stains on the edge. Different cover. Edition 1988. Ammareal gives back up to 15% of this item's net price to charity organizations.

N� de ref. del art�culo E-591-001

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Programming in Networks and Graphs: On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms
Editor: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Fecha de publicaci�n: 1988
Idioma: Ingl�s
ISBN 10: 3540189696
ISBN 13: 9783540189695
Encuadernaci�n: Softcover
Estado: Tr�s bon

Acerca de

Sinopsis

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.

Rese�a del editor

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

English below. Ammareal est une librairie professionnelle sp�cialis�e dans le livre d?occasion. Nous exp�dions partout dans le monde. Nous avons plus de 250 000 ouvrages en stock dont un grand nombre de livres techniques et acad�miques. Nous reversons jusqu?� 15% du prix de vente de chaque livre � des organisations caritatives, des biblioth�ques et des associations luttant contre l?illettrisme. Ce que nous ne vendons pas nous le donnons, ce que nous ne donnons pas nous le recyclons. Ammareal is a professional bookseller speciliazed in used books. We ship worldwide. We have more than 250 000 books in stock, including a large number of technical and university-level books. We give back up to 15% of the price of each book to charities, libraries and organizations fighting in favor of literacy. What we do not sell, we give, what we do not give we recycle.

Ver la p�gina web de la librer�a