A characterization of network representable polymatroids
| Autor(en): | Bein, W.W. Brucker, P. Stallmann, M.F.M. |
Stichwörter: | Gammoids; Network Flows; Network Representability; Polymatroids; Submodular Functions | Erscheinungsdatum: | 1991 | Herausgeber: | Physica-Verlag | Enthalten in: | ZOR Zeitschrift fü Operations Research Methods and Models of Operations Research | Band: | 35 | Ausgabe: | 4 | Startseite: | 267 | Seitenende: | 272 | Zusammenfassung: | Meggido [1974] showed that the maximum flow through sets of sources in a multiple sink flow network is a polymatroidal function. Recently, Federgruen and Groenevelt [1985], [1986] have considered polymatroids that can be represented by a multiple source flow network and have improved the runnung time of an important scheduling application. We give a characterization of network representability and relate representable polymatroids to the theory of gammoids. © 1991 Physica-Verlag. |
ISSN: | 03409422 | DOI: | 10.1007/BF01417514 | Externe URL: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-34249918530&doi=10.1007%2fBF01417514&partnerID=40&md5=86ad1e31885623e2945248ec8cb864d5 |
Zur Langanzeige
Seitenaufrufe
5
Letzte Woche
0
0
Letzter Monat
0
0
geprüft am 07.06.2024
