Programming in Networks and Graphs
Afbeeldingen
Artikel vergelijken
Samenvatting
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.
Productspecificaties
Wij vonden geen specificaties voor jouw zoekopdracht '{SEARCH}'.
Inhoud
- Taal
- en
- Bindwijze
- Paperback
- Aantal pagina's
- 332
- Illustraties
- Nee
Betrokkenen
- Hoofdauteur
- Ulrich Derigs
- Hoofduitgeverij
- Springer
Overige kenmerken
- Verpakking breedte
- 152 mm
- Verpakking hoogte
- 19 mm
- Verpakking lengte
- 229 mm
- Verpakkingsgewicht
- 489 g
EAN
- EAN
- 9783642517143
Je vindt dit artikel in
- Categorieën
- Taal
- Engels
- Boek, ebook of luisterboek?
- Boek
- Studieboek of algemeen
- Algemene boeken
Kies gewenste uitvoering
Bindwijze
: Paperback
Prijsinformatie en bestellen
Rapporteer dit artikel
Je wilt melding doen van illegale inhoud over dit artikel:
- Ik wil melding doen als klant
- Ik wil melding doen als autoriteit of trusted flagger
- Ik wil melding doen als partner
- Ik wil melding doen als merkhouder
Geen klant, autoriteit, trusted flagger, merkhouder of partner? Gebruik dan onderstaande link om melding te doen.